def is_palindrome(s):
l,r=0,len(s)-1
while l<r:
if s[l]!=s[r]: return False
l+=1; r-=1
return True
public boolean isPalindrome(String s){
int l=0,r=s.length()-1;
while(l<r){
if(s.charAt(l)!=s.charAt(r)) return false;
l++; r--;
} return true;
}
Direct indexing vs charAt(). True/False vs true/false.
def is_palindrome(s):
l,r=0,len(s)-1
while l<r:
if s[l]!=s[r]: return False
l+=1; r-=1
return True
public boolean isPalindrome(String s){
int l=0,r=s.length()-1;
while(l<r){
if(s.charAt(l)!=s.charAt(r)) return false;
l++; r--;
} return true;
}
1. Compare from both ends 2. Move inward