<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>

bool iterateString(string s, int left, int right, bool skip){
        bool p1 = false, p2 = false;
        while(left < right){
            if(s[left] != s[right]){
                if(skip){
                    return false;
                }
                else{
                    skip = true;
                    if(s[left] == s[right - 1]){
                        p1 = iterateString(s, left, right-1, skip);
                    }
                    if (s[right] == s[left + 1]){
                        p2 = iterateString(s, left+1, right, skip);
                    }
                    return p1 || p2;
                }
            }
            else{
                left++;
                right--;
            }

        }
        return true;
    }

class Solution {
public:
    bool validPalindrome(string s) {
        int left = 0 , right = s.size() - 1;
        bool skip = false;
        return iterateString(s, left, right, skip);
    }
};
26301