/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

1 vote128 views2 answers
How to sort numbers in typescript
TypeScript
0 vote151 views1 answer
Which electromagnetic radiation is used for heating and night vision equipment
TypeScript
0 vote148 views1 answer
Piechart am4charts legend with actual values
TypeScript
0 vote135 views1 answer
Could not resolve all artifacts for configuration ':classpath'.
TypeScript
0 vote144 views1 answer
Distributed Cron Job
TypeScript
0 vote135 views1 answer
C code for insrting elements in set
TypeScript
0 vote135 views1 answer
Typescript cast to type remove properties
TypeScript
0 vote129 views1 answer
Which of the foolowing ia an element of pallette that holds multiple elements of nspecific purpose
TypeScript
2 votes134 views2 answers
Remove all the elements from a numpy array python
TypeScript
3 votes131 views1 answer
Angular resize window height event
TypeScript