/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 vote132 views1 answer
Get n random elements from list java
TypeScript
2 votes139 views1 answer
Check typescript version
TypeScript
0 vote128 views1 answer
Related posts wordpress without plugin
TypeScript
0 vote126 views1 answer
Cannot find name 'describe'. Do you need to install type definitions for a test runner? Try `npm i --save-dev @types/jest`
TypeScript
0 vote129 views1 answer
How to show array of objects in flatlist react native
TypeScript
0 vote144 views1 answer
Why are lower case alphabets more preffered in html
TypeScript
0 vote144 views1 answer
No database host was found that meets the requirements for this server.
TypeScript
1 vote130 views1 answer
How do you generate test data
TypeScript
0 vote126 views1 answer
Pandas get count of pair of elements in two columns
TypeScript
1 vote126 views1 answer
Unity lists number of
TypeScript