/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 vote101 views1 answer
Node fetch image to base64
TypeScript
6 votes104 views2 answers
Ignore typescript error
TypeScript
0 vote118 views1 answer
Get database num hits django
TypeScript
0 vote132 views1 answer
More than one custom value accessor matches form control with unspecified name attribute
TypeScript
0 vote118 views1 answer
Swift collection view deselects item when scroll off screen
TypeScript
0 vote102 views1 answer
What is hello world in typescript
TypeScript
0 vote95 views1 answer
Searching filtering ibraries in angular
TypeScript
1 vote108 views1 answer
How to edit unity scripts in sublime text
TypeScript
0 vote91 views2 answers
Mat datepicker timezone not correct
TypeScript
1 vote121 views1 answer
Type annotations can only be used in TypeScript files.
TypeScript