/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 vote200 views1 answer
How many bits are there in a hexadecimal digit
TypeScript
0 vote278 views1 answer
Typescript static example
TypeScript
5 votes244 views3 answers
React-native init typescript
TypeScript
0 vote202 views1 answer
Google chrome keyboard shortcuts windows
TypeScript
-2 votes228 views5 answers
Mysqli_fetch_array() expects parameter 1 to be mysqli_result, boolean given
TypeScript
1 vote204 views1 answer
Github sync local with remote
TypeScript
0 vote260 views1 answer
Angular tokenize
TypeScript
-1 vote207 views1 answer
Is brackets a good code editor
TypeScript
1 vote222 views2 answers
Dart clone list
TypeScript
13 votes221 views4 answers
Change checkbox jquery alert
TypeScript