/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 vote156 views1 answer
Python program to extract characters from various text files and puts them into a list
TypeScript
1 vote139 views1 answer
Python program to find sum of digits of a number using while loop
TypeScript
0 vote145 views1 answer
Angular get user location
TypeScript
0 vote183 views1 answer
Circular indicator gets whole page flutter
TypeScript
0 vote129 views1 answer
Pass command line arguments C#
TypeScript
0 vote142 views1 answer
Query orders by products woocommerce
TypeScript
0 vote147 views1 answer
Find common elements in two flutter
TypeScript
0 vote166 views1 answer
{"msg": "Attempting to decrypt but no vault secrets found"}
TypeScript
1 vote183 views1 answer
Delete contents of folder java
TypeScript
0 vote160 views1 answer
Checked a element is focused with its key pressed
TypeScript