<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 validPalindrome(string s, bool powerUp = true, int i=0, int j=-1) {
    if(j==-1) j=s.length()-1;
        while(i<j){
            if(s[i]!=s[j]){
                if(powerUp){
                    if(s[i+1]==s[j]){
                        if(validPalindrome(s, false, i+1, j)){
                          cout << "hello";
                            return true;
                        }else{
                          cout << "bye";
                        }
                    }
                    if(s[i]==s[j-1]){
                        if(validPalindrome(s, false, i, j-1)){
                          cout << "hello";
                            return true;
                        }else{
                          cout << "bye";
                        }
                    }
                    return false;
                    powerUp=false;
                }else{
                  cout << i << ' ' << j << endl;
                    return false;
                }
            }
            i++; j--;
        }
        return true;
    }
};
21541