/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 vote194 views1 answer
Angular how to use observable object async
TypeScript
-1 vote183 views1 answer
Fusion builder elegant elements for free
TypeScript
12 votes159 views3 answers
Intersection of lists in python
TypeScript
1 vote171 views1 answer
Track changes of input in angular
TypeScript
0 vote153 views1 answer
Google sheets past tsv data
TypeScript
1 vote177 views1 answer
Ion2 calendar locale
TypeScript
8 votes191 views6 answers
How to make lists in python
TypeScript
0 vote161 views1 answer
Choose random elements from vector without repetition and adding to another vector c++
TypeScript
0 vote169 views1 answer
Pandas get count of pair of elements in two columns
TypeScript
0 vote166 views1 answer
Difference between facets and filters algolia
TypeScript