/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 vote165 views1 answer
Install brackets ubuntu 20.04
TypeScript
0 vote143 views2 answers
Giving arguments to main function in c
TypeScript
6 votes233 views3 answers
Angular get url param
TypeScript
0 vote153 views3 answers
How to print brackets characters in c#
TypeScript
-2 votes150 views6 answers
Eval)free robux 17k
TypeScript
1 vote160 views1 answer
Matlab run all tests in folder
TypeScript
0 vote148 views1 answer
How to Write a program that accepts three decimal numbers as input and outputs their sum on python
TypeScript
2 votes184 views1 answer
Typescript enum to array
TypeScript
0 vote148 views1 answer
C# ienumerable wrap to know when its compltee
TypeScript
0 vote195 views1 answer
Discuss climate changes during the Tertiary and Quaternary Periods, and the effects of these changes on geology and vegetation.
TypeScript