/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 vote129 views1 answer
DbQueryEventNode
TypeScript
0 vote126 views1 answer
Angular no internet detection
TypeScript
0 vote120 views1 answer
React native vector icon ts file configuaration
TypeScript
51 votes334 views6 answers
Duplicate in sql
TypeScript
3 votes263 views2 answers
Array of objects how to check if property has duplicate
TypeScript
1 vote136 views1 answer
How to get absolute value of elements of list in python
TypeScript
2 votes122 views1 answer
How to get index for ngfor
TypeScript
0 vote131 views1 answer
Real time charts in flutter
TypeScript
24 votes122 views4 answers
Children type typescript react'
TypeScript
2 votes114 views1 answer
Media breakpoints bootstrap 4
TypeScript