<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 , int l , int r ,int c)
   {
    if(c==2) return false;
    if( l>= r) return true;
    if( s[l]==s[r])
    {   if( validPalindrome(s,l+1,r-1, c)==true) return true;
    }
    else{
         if( validPalindrome(s,l+1,r,c+1)==true) return true;
         if( validPalindrome(s,l,r-1,c+1) ==true ) return true;
    }
    return false;
   }
    bool validPalindrome(string s) {
        int left , right;
        int c = 0;
        left = 0;
        right = s.length()-1;
       return validPalindrome( s,left,right,c);
         
    }
};
20351