/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

3 votes189 views4 answers
Angular images
TypeScript
5 votes183 views4 answers
Element implicitly has an 'any' type because expression of type 'string' can't be used to index type
TypeScript
8 votes180 views6 answers
Dotenv typescript
TypeScript
0 vote179 views2 answers
Unique list typescript
TypeScript
0 vote139 views0 answer
TypeScript
17 votes190 views3 answers
Js null ==
TypeScript
1 vote209 views1 answer
A device that interconnects two local area networks that both have a medium access control sublayer.
TypeScript
9 votes283 views3 answers
Typescript object to array
TypeScript
0 vote176 views1 answer
Dynamic key interface typescript
TypeScript
0 vote185 views1 answer
Response 404 requests python compare
TypeScript