680. Valid Palindrome II Given a string s, return true if the s can be palindrome after deleting at most one character from it. 123456789101112class Solution { bool helper(string& s, bool rm, int l, int r) { if(l >= r) return true; if(s[l] == s[r]) return helper(s,rm,l+1,r-1); if(rm) return false; return helper(s,true,l+1,r) or helper(s,true,l,r-1); }public: bool validPalindrome(string s) { return helper(s,false,0,s.length()-1); }};