/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 vote312 views1 answer
Benefits eat halim plant leaves
TypeScript
3 votes320 views1 answer
Typescript array string to array literal
TypeScript
0 vote299 views1 answer
3 parts of apptitude
TypeScript
6 votes354 views4 answers
Property 'style' does not exist on type 'Element'.ts(2339)
TypeScript
6 votes335 views1 answer
List of environment python
TypeScript
0 vote400 views1 answer
Filter() array of objects on change react
TypeScript
5 votes344 views2 answers
Copy array typescript
TypeScript
0 vote313 views1 answer
Rest api django return value if exists in another table
TypeScript
0 vote309 views1 answer
Ngx-numeral
TypeScript
0 vote332 views1 answer
Pass parameter to NestJs Guard
TypeScript