/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 vote153 views1 answer
Base64 encode typescript
TypeScript
0 vote168 views1 answer
Test plan vs qa plan
TypeScript
0 vote167 views1 answer
Convert javascript to typescript
TypeScript
4 votes150 views1 answer
Ionic toast
TypeScript
7 votes151 views6 answers
How to Reload a Component in Angular
TypeScript
0 vote169 views1 answer
How to show account related contacts on click of a button using lightnig components
TypeScript
0 vote158 views1 answer
Uat testing vs system testing
TypeScript
0 vote157 views1 answer
Pass generic type to arow function typescript
TypeScript
0 vote142 views1 answer
How to list elements of an array C#
TypeScript
3 votes160 views3 answers
Cannot find module 'typescript' angular 9
TypeScript