int length = myString.Length;
for (int i = 0; i < length / 2; i++)
{
if (myString[i] != myString[length - i - 1])
return false;
}
return true;Input: S = "abba"Output: 1Explanation: S is a palindrome
int isPalindrome(string S)
{
string st = S;
char temp;
int i=0, j= st.length()-1;
while(j>i)
{
if(S[i] != S[j])
{
return 0;
}
i++;
j--;
}
return 1;
}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];
}
}function isPalindrome(str) {
str = str.toLowerCase();
return str === str.split("").reverse().join("");
}