<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 solve(string st,int start,int end){
    while(start<=end){
        if(st[start]!=st[end]) return false;
        start++;
        end--;
    }
    return 1;
}
    bool validPalindrome(string s) {
        int st=0;
        int end=s.size()-1;
        string str;
        while(st<=end){
            if(s[st]!=s[end]){
                str=s.substr(st,end-st+1);
                break;
            }
            st++;
            end--;
        }
        if(str=="") return 1;
        bool flag1=solve(str,0,str.size()-2);
        bool flag2=solve(str,1,str.size()-1);

        // cout<<str;
        return flag1||flag2;
    }
};
27045