<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(const string& s) {
        int l = 0; 
        int r = s.size() - 1;

        while(l < r) {
            if(s[l] != s[r])
                return false;

            ++l;
            --r;
        }

        return true;
    }

    bool validPalindrome(string s) {
        if(s.size() == 1)
            return true;

        if(isPalindrome(s))
            return true;
        bool deleted = false;
        int i = 0; int j = s.size() - 1;
        while(i < j) {
            if(s[i] == s[j]){
                ++i;
                --j;
                continue;
            }
            cout << i << " " << j << endl;
            if(deleted)
                return false;
            
            bool valid = false;
            string tester = s.substr(i + 1, j - i);
            cout << tester << endl;
            valid = isPalindrome(tester);
            if(valid) {
                ++i;
                continue;
            } else {
                tester = s.substr(i, j - i);
                valid = isPalindrome(tester);
            }

            if(!valid)
                return false;
            else
                --j;
            deleted = true;
        }


        return true;
    }
};
23475