/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 vote100 views1 answer
Using method parameters in a guard nestjs
TypeScript
0 vote102 views1 answer
Pointer vers dépots distants git hub
TypeScript
-1 vote111 views1 answer
Git command to check for any conflicts between new and old versions on your repository
TypeScript
11 votes99 views2 answers
How to read a list in c# once its created
TypeScript
0 vote102 views1 answer
Python starts with capital letter
TypeScript
0 vote106 views1 answer
Number of elements in circular queue
TypeScript
0 vote101 views1 answer
Godot preload
TypeScript
5 votes138 views2 answers
Pass function as argument typescript
TypeScript
0 vote96 views2 answers
Typescript one of array
TypeScript
0 vote118 views1 answer
Typescript vue 3 css property !important
TypeScript