/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

5 votes221 views3 answers
Typescript with nodemon
TypeScript
1 vote222 views1 answer
Remove contraints command psql
TypeScript
25 votes230 views10 answers
Bootstrap
TypeScript
1 vote169 views1 answer
Undefined string typescript
TypeScript
0 vote221 views1 answer
Optional chaining
TypeScript
2 votes217 views2 answers
Change material ui appbar color
TypeScript
1 vote221 views1 answer
Is assigned a value but never used
TypeScript
0 vote230 views1 answer
Module svg typescript
TypeScript
1 vote195 views2 answers
Measurement technique of total fiber attenuation gives
TypeScript
0 vote298 views1 answer
Flutter web keep focus on textfield
TypeScript