<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) {
        string a=s;
        int i=0, j=s.size()-1,l=0;
        int c=0;

       
        while(i<=j)
        {
            if(a[i]!=a[j] )
            {
                if(c==0)
                {
                    a.erase(i,1);
                    i--;
                    c++;
                }
                else
                {
                    l=1;
                    break;
                }
            }
            i++;
            j--;
        }
          

        if(l==0)
        return true;

        else if(c==1 && l==1)
        {
            i=0; j=s.size()-1;

            while(i<=j)
            {
                if(s[i]!=s[j] )
                {
                    if(c==1)
                    {
                        s.erase(j,1);
                        i--;
                        c++;
                    }
                    else
                    {
                        l=2;
                        break;
                    }
                }
                i++;
                j--;
            }
        }


        if(l==2)
        return false;
        else
        return true;
    }
};
22434