/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 vote302 views1 answer
How to ignore a field while desiarilizing in java if its type is not wrong
TypeScript
0 vote311 views1 answer
How push objects into a local stotage array
TypeScript
-1 vote291 views1 answer
Flutter get height of status bar
TypeScript
0 vote578 views1 answer
Cacerts default password
TypeScript
0 vote302 views1 answer
How to get all dates from range in react js
TypeScript
0 vote304 views2 answers
Styled components tw
TypeScript
9 votes296 views6 answers
Laravel exists validation
TypeScript
0 vote286 views1 answer
'mat-icon' is not a known element:
TypeScript
0 vote264 views1 answer
What is the importance of testng xml file
TypeScript
0 vote301 views1 answer
Styled components gatsby
TypeScript