/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 vote181 views1 answer
Oracle objects in tablespace
TypeScript
0 vote191 views1 answer
// running tests Your code should no longer have a p tag around the text asking what level ninja a user is. // tests completed category:423
TypeScript
46 votes244 views6 answers
Install requests python
TypeScript
0 vote164 views1 answer
Elements in body don't want to center
TypeScript
1 vote181 views1 answer
List the constituents of the xylem. what would happen if the xylem of root of a plant is blocked?
TypeScript
0 vote168 views1 answer
Download blob typescript
TypeScript
2 votes173 views3 answers
Gets is in which header file
TypeScript
0 vote183 views3 answers
Saving leaderstats script roblox
TypeScript
1 vote172 views1 answer
Javascript audio delay
TypeScript
1 vote246 views1 answer
React routes not working after build
TypeScript