<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 isPalindrome(string s, bool chance) {
        for(int head = 0, tail = s.length() - 1; tail >= head; head++, tail--){
            if(s[head] != s[tail]){
                if(!chance)
                    return false;

                if(isPalindrome(s.substr(head + 1, tail - head), false)) //skip left
                    return true;
                else if(isPalindrome(s.substr(head, tail - head), false)) //skikp right
                    return true;
                else
                    return false;            
            }

        }

        return true;
    }

    bool validPalindrome(string s) {
        
        return isPalindrome(s, true);
    }
};
28235