/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

1 vote213 views1 answer
Custom decorator in loopback4
TypeScript
0 vote198 views1 answer
Material ui iccons
TypeScript
0 vote191 views1 answer
Python fancy way to get arguments from the command line
TypeScript
0 vote185 views1 answer
Typescript record optional
TypeScript
6 votes195 views1 answer
Typescript map list to new list of objects
TypeScript
1 vote220 views1 answer
Psycopg2 OperationalError: FATAL: unsupported frontend protocol 1234.5679: server supports 2.0 to 3.0
TypeScript
0 vote157 views1 answer
Lists - Learn C#
TypeScript
7 votes191 views1 answer
Initialize vector c++ with 0
TypeScript
0 vote201 views1 answer
Ts add property to interface
TypeScript
0 vote187 views1 answer
Print all objects linked list python
TypeScript