<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 {
    bool helper(string& str, bool jump, int start, int end){
        if(end-start<=0) return true;
        bool currentMatch = 
            (str[start]==str[end] and helper(str,jump,start+1,end-1));
        if(jump) 
            currentMatch = currentMatch or 
            helper(str,false,start+1,end) or 
            helper(str,false,start,end-1);
        return currentMatch;
    }
public:
    bool validPalindrome(string str) {
        return helper(str,true,0,str.size()-1);
    }
};
21244