/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

7 votes182 views1 answer
How many alphabets in english
TypeScript
0 vote212 views1 answer
Typescript interview questions
TypeScript
76 votes572 views6 answers
Running scripts is disabled on this system
TypeScript
3 votes169 views1 answer
Model has no objects member django
TypeScript
4 votes174 views2 answers
Unity rigidbody constraints unfreeze
TypeScript
0 vote296 views1 answer
Check in Recat if an url is of image or video
TypeScript
0 vote203 views1 answer
Auto complete of process.env in typescript
TypeScript
0 vote237 views1 answer
Whats the tempurature
TypeScript
2 votes188 views5 answers
Js create query string from object
TypeScript
1 vote180 views1 answer
React-native gesturehandler modalize ios onpress
TypeScript