/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 vote206 views1 answer
Text size in plots in r
TypeScript
0 vote190 views1 answer
Scss all elements inside
TypeScript
0 vote236 views1 answer
Haskell get specific elements of a String
TypeScript
0 vote236 views1 answer
Typescript not supporting scss
TypeScript
28 votes183 views4 answers
Install typescript
TypeScript
0 vote196 views1 answer
How to delete a message by its id
TypeScript
0 vote287 views1 answer
Downgrade typescript version
TypeScript
0 vote187 views1 answer
'mat-icon' is not a known element:
TypeScript
5 votes191 views2 answers
Formgroup check if valid
TypeScript
3 votes238 views2 answers
How to compile typescript
TypeScript