/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

0 vote179 views1 answer
Do you use data structures in your current automation project
TypeScript
9 votes154 views1 answer
How to print list as matrix in python without brackets
TypeScript
0 vote171 views1 answer
Dota 2 space to center hero
TypeScript
0 vote158 views1 answer
Check if all elements in array can be divided by python
TypeScript
8 votes156 views1 answer
Styled components hover
TypeScript
1 vote154 views1 answer
NullInjectorError: R3InjectorError(ProfilePageModule)[Camera -> Camera -> Camera
TypeScript
0 vote176 views1 answer
Module.exports mongodb connection
TypeScript
0 vote194 views1 answer
Jest not toBe
TypeScript
0 vote161 views1 answer
Sum all elements using each_with_object ruby
TypeScript
6 votes175 views3 answers
Any typescript
TypeScript