/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

3 votes286 views2 answers
MySQL update if exists else insert
TypeScript
0 vote295 views1 answer
Generate module in ionic 4|5|6
TypeScript
1 vote252 views1 answer
Typing in typescript
TypeScript
11 votes284 views1 answer
How to select last 2 elements in a string python
TypeScript
1 vote265 views1 answer
React typescript custom hook
TypeScript
0 vote257 views1 answer
Mongodb nest.js
TypeScript
0 vote292 views1 answer
Typeorm @unique
TypeScript
0 vote251 views1 answer
Typescript exclamation mark
TypeScript
1 vote244 views2 answers
Benefits of linux
TypeScript
0 vote281 views1 answer
Push array elements if not exists mongoose
TypeScript