<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) {
        cout << "s = " << s << endl;
        int left = 0;
        int right = s.length() - 1;

        while (left <= right) {
            if (s[left] != s[right]) {
                return false;
            }

            // update indices
            left++;
            right--;
        }

        return true;
    }

    bool validPalindrome(string s) {
        bool isPalidrome = true;

        int left = 0;
        int right = s.length() - 1;

        while (left <= right) {
            if (s[left] == s[right]) {
                // update indices
                left++;
                right--;
            } else {
                // check if could be palidrome after removing one character

                // 1. left ~ right -1
                // 2. left + 1 ~ right
                if (isPalindrome(s.substr(left, right - left)) ||
                    isPalindrome(s.substr(left + 1, right - left))) {

                    cout << "s.substr(left, right - 1) = " << s.substr(left, right - 1) << endl;
                    cout << "s.substr(left + 1, right) = " << s.substr(left + 1, right) << endl;
                    isPalidrome = true;
                    break;
                } else {
                    isPalidrome = false;
                    break;
                }
            }
        }

        return isPalidrome;
    }
};
27194