/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 vote245 views1 answer
Apexcharts colors function
TypeScript
4 votes181 views4 answers
ERROR in The Angular Compiler requires TypeScript >=4.0.0 and <4.1.0 but 3.4.5 was found instead.
TypeScript
0 vote186 views1 answer
Typescript check if value is in enum
TypeScript
1 vote197 views1 answer
Angular innerhtml style not working
TypeScript
0 vote184 views1 answer
Replace element in array typescript
TypeScript
0 vote201 views1 answer
Directory. Relative imports outside of src/ are not supported.
TypeScript
11 votes174 views6 answers
Localstorage
TypeScript
0 vote176 views1 answer
Typescript type array of interface
TypeScript
0 vote196 views1 answer
Aws sts get-caller-identity extract account
TypeScript
0 vote187 views1 answer
Hsbc uk
TypeScript