/TypeScript/Minimum number of cycle shifts for each string if it can be made palindrome

Minimum number of cycle shifts for each string if it can be made palindrome

import java.util.Scanner;

public class PalyndromeTest {
    static boolean isPalyndrome(String s, int shift) {
        int n = s.length();
        if(shift < 0) shift+=n;
        for(int pos = 0; pos < n/2; pos++) {
            if(s.charAt((pos+shift)%n) != s.charAt((n-pos-1+shift)%n))
                return false;
        }
        return true;
    }

    static int findShift(String s) {
        for(int shift = 0; shift <= s.length()/2; shift++) {
            if(isPalyndrome(s, shift) || isPalyndrome(s, -shift))
                return shift;
        }
        return -1;
    }

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int count = s.nextInt();
        s.nextLine();
        for(int i=0; i<count; i++) {
            System.out.println(findShift(s.nextLine()));
        }
    }
}

Source: stackoverflow.com

Similar codes

0 vote341 views3 answers
Online js to typescript converter
TypeScript
0 vote323 views1 answer
Read/write linked lists to file
TypeScript
0 vote321 views1 answer
Rest api django return value if exists in another table
TypeScript
1 vote348 views1 answer
Ts date get minutes
TypeScript
0 vote375 views1 answer
Circular indicator gets whole page flutter
TypeScript
0 vote307 views1 answer
Loading assets in ionic react
TypeScript
0 vote329 views1 answer
Ionic email validation
TypeScript
38 votes395 views4 answers
Comments inside children section of tag should be placed inside braces
TypeScript
0 vote325 views1 answer
Powershell see ports in use
TypeScript
0 vote343 views2 answers
How to teleport a sprite to a new room in game maker studio 2
TypeScript