<p>Given a string <code>s</code>, return <code>true</code> <em>if the </em><code>s</code><em> can be palindrome after deleting <strong>at most one</strong> character from it</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abca&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> You could delete the character &#39;c&#39;.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool PalindromeChecker(string str, int left,int right){

        while (left < right) {
            if (str[left] != str[right]) {
                return false;
            }
            left++;
            right--;
        }
        return true;
    }

    bool validPalindrome(string s) {
        int l=0;
        int r=s.size()-1;
        int mis=0;
        int i=-1,j=-1;
        while(l<=r){
            if(s[l]!=s[r] and mis>0) return false;
            else if(s[l]!=s[r] and mis==0){
                if(s[l]!=s[r-1] and s[r]!=s[l+1]) return false;
                if(s[l]==s[r-1] and s[r]==s[l+1]){
                    i=l, j=r;
                    break;
                }
                else if(s[l]==s[r-1]) r--;
                else l++;
                mis++;
            }
            else l++,r--;
        }
        if(i!=-1 and j!=-1){
            return (PalindromeChecker(s,i,j-1) or PalindromeChecker(s,i+1,j));
        }
        return true;
    }
};
19310