/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

11 votes312 views2 answers
React tsx component example
TypeScript
0 vote373 views1 answer
Sourcetree winmerge arguments three way merge
TypeScript
3 votes305 views3 answers
Ts enum
TypeScript
0 vote303 views1 answer
Git remove last two commits from branch
TypeScript
0 vote297 views1 answer
Surround substring with quotes
TypeScript
21 votes318 views2 answers
Npm typescript package
TypeScript
0 vote296 views1 answer
Angular build router-outlet not working
TypeScript
1 vote329 views2 answers
Typescript formik useFormik
TypeScript
-1 vote307 views1 answer
React react-dom react-scripts cra-template has failed.
TypeScript
0 vote313 views1 answer
Module.exports mongodb connection
TypeScript