/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

2 votes193 views2 answers
Close mat dialog from component
TypeScript
0 vote184 views1 answer
Flights starting from in india
TypeScript
1 vote169 views1 answer
Fetch syntax in javascript
TypeScript
0 vote201 views1 answer
Vertical dots latex
TypeScript
0 vote255 views1 answer
Copy all elements from one list to another ajav
TypeScript
0 vote216 views3 answers
Spade operator typescript
TypeScript
0 vote201 views1 answer
Keyboard events pygame
TypeScript
0 vote184 views1 answer
Admin_enqueue_scripts specific page
TypeScript
0 vote218 views1 answer
Difference between scripted testing and exploratory testing
TypeScript
0 vote189 views1 answer
Permalink of pending posts not working
TypeScript