/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 vote196 views1 answer
Flutter check if app is in foreground
TypeScript
5 votes258 views3 answers
Add space between subplots matplotlib
TypeScript
0 vote254 views1 answer
Check if that inex exisits array c#
TypeScript
1 vote251 views1 answer
Node fetch exports is not defined
TypeScript
1 vote245 views1 answer
Tostring kotlin
TypeScript
1 vote303 views1 answer
Class-validator validate nested object
TypeScript
3 votes260 views1 answer
Typescript parameter function type
TypeScript
0 vote252 views1 answer
Difference known_hosts authorized_keys
TypeScript
0 vote258 views1 answer
Change field name relation typeorm
TypeScript
0 vote207 views1 answer
Weights [0.03333567, 0.07472567, 0.10954318, 0.13463336, 0.14776211, 0.14776211, 0.13463336, 0.10954318, 0.07472567, 0.03333567]
TypeScript