<p>Given a string <code>s</code>, return <em>the number of <strong>palindromic substrings</strong> in it</em>.</p>

<p>A string is a <strong>palindrome</strong> when it reads the same backward as forward.</p>

<p>A <strong>substring</strong> is a contiguous sequence of characters within the string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong> Three palindromic strings: &quot;a&quot;, &quot;b&quot;, &quot;c&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aaa&quot;
<strong>Output:</strong> 6
<strong>Explanation:</strong> Six palindromic strings: &quot;a&quot;, &quot;a&quot;, &quot;a&quot;, &quot;aa&quot;, &quot;aa&quot;, &quot;aaa&quot;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    int checkpal(string s){

        int l=0,r=s.length()-1;
        // cout<<"s:"<<s<<" "<<l<<" "<<r<<" ";
        while(l<=r){
            if(s[l]==s[r]){
                l++;
                r--;
            }
            else{
                // cout<<"ret 0"<<endl;
                return 0;
            }
        }
        // cout<<"ret 1"<<endl;
        return 1;
    }
    int countSubstrings(string s) {
        int ans = 0;
        int n=s.length();
        for(int si=0;si<n;si++){
            for(int bi=si;bi<n;bi++){
                if(s[si]!=s[bi]) continue;
                ans += checkpal(s.substr(si,bi-si+1));
            }
        }
        return ans;
    }
};
455833