/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 vote150 views1 answer
Omgsmhwthwhyomgnvm
TypeScript
0 vote165 views1 answer
Sets letter latex
TypeScript
34 votes155 views4 answers
How to get duplicate elements in sql
TypeScript
1 vote148 views1 answer
Ionic maintain order of object properties
TypeScript
8 votes170 views2 answers
See conda enviroments
TypeScript
0 vote144 views1 answer
How can you run your test in different environments
TypeScript
1 vote160 views1 answer
How to pass children in react typescript
TypeScript
0 vote157 views1 answer
Regex exec returns null
TypeScript
0 vote163 views1 answer
Can we use function overloading and default arguments at same time in c++
TypeScript
0 vote148 views1 answer
Will Tenet come in plate format
TypeScript