<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 c_p(string s,int l,int h){
    while(l<=h){
        if(s[l]==s[h]){
            l++;
            h--;
        }
        else{
            return false;
        }
    }
    return true;
}

    bool validPalindrome(string s) {
        int l=0;
        int h=s.length()-1;

        while(l<=h){
            if(s[l]==s[h]){
                l++;
                h--;
            }
            else{
                bool ans1= c_p(s,l+1,h);
                bool ans2=c_p(s,l,h-1);
                bool f_ans= ans1|| ans2;

                return f_ans;
            }
        }
        
        return true;
    }
};
25260