/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 vote275 views2 answers
Python remove all double elements from list
TypeScript
0 vote285 views1 answer
Grants ORACLE
TypeScript
4 votes275 views2 answers
Magento 2 enable template hints command line
TypeScript
0 vote260 views1 answer
Algebra is simply overlaying sets of equations onto the world around us.
TypeScript
0 vote267 views1 answer
Bitwarden CLI Cheatsheet
TypeScript
0 vote278 views1 answer
Typescript sort number array descending
TypeScript
1 vote281 views1 answer
Headphone disconnects in ubuntu
TypeScript
0 vote264 views1 answer
Vscode use relative paths in auto import
TypeScript
0 vote283 views1 answer
Typoescript find multiple items in array and return found
TypeScript
0 vote266 views1 answer
Socket.io typescript
TypeScript