minimum characters to make string palindrome
string s;
int len=0,i=1;
cin>>s;
int n=s.size();
vector<int> LPS(n);
LPS[0]=0;
while(i<n)
{
if(s[i]==s[len]) LPS[i++]=++len;
else
{
if(len==0) LPS[i++]=0;
else len=LPS[len-1];
}
}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()));
}
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
