class Solution:
def validPalindrome(self, s: str) -> bool:
i = 0
j = len(s) - 1
while i <= j:
if s[i].lower() != s[j].lower():
skipL,skipR = s[i+1:j+1] , s[i:j]
return (skipL == skipL[::-1]) or (skipR == skipR[::-1])
i+=1
j-=1
return True
Y2xhc3MgU29sdXRpb246CiAgICBkZWYgdmFsaWRQYWxpbmRyb21lKHNlbGYsIHM6IHN0cikgLT4gYm9vbDoKICAgICAgICBpID0gMAogICAgICAgIGogPSBsZW4ocykgLSAxCiAgICAgICAgd2hpbGUgaSA8PSBqOgogICAgICAgICAgICBpZiBzW2ldLmxvd2VyKCkgIT0gc1tqXS5sb3dlcigpOgogICAgICAgICAgICAgICAgc2tpcEwsc2tpcFIgPSBzW2krMTpqKzFdICwgc1tpOmpdCiAgICAgICAgICAgICAgICByZXR1cm4gKHNraXBMID09IHNraXBMWzo6LTFdKSBvciAoc2tpcFIgPT0gc2tpcFJbOjotMV0pCiAgICAgICAgICAgIGkrPTEKICAgICAgICAgICAgai09MQogICAgICAgIAogICAgICAgIHJldHVybiBUcnVlCiAgICAgICAgICAgIA==