<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:
    def validPalindrome(self, s: str) -> bool:
        deletedCount = 0
        def validPalin(left, right):
            nonlocal deletedCount
            l = left
            r = right
            

            while(l <= r):
                if s[l] == s[r]:
                    l += 1
                    r -= 1
                else:
                    if deletedCount == 1:
                        return False

                    if l + 1 == r:
                        return True
                    
                    deletedCount += 1

                    return validPalin(l+1, r) or validPalin(l, r-1)
                    


            return True
       
        return validPalin(0, len(s)-1)



19800