<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 c=0;
int count(string s,int a,int b,int &sum){
     c=s.size();
    if(a>=0 and b<c){
        if(s[a]==s[b]){

        sum++;
        count(s,a-1,b+1,sum);
        }
        else{
            return sum;
        }
    }
   
        
        return sum;
    
   
}
int count1(string s,int a,int b,int &sum){
     c=s.size();
    if(a>=0 and b<c){
        if(s[a]==s[b]){

        sum+=1;
        count1(s,a-1,b+1,sum);
        }
        else{
            return sum;
        }
    }
  
        
        return sum;
    
}
    int countSubstrings(string s) {
        int sum1=s.size();
        int sum=0;
       int a=0;
       int b=0;
       
        for(int i=0;i<s.size();i++){
            a=i-1;
            b=i+1;
            sum1=sum1+count(s,a,b,sum);
            sum=0;
            a=i;
            b=i+1;
            sum1=sum1+count1(s,a,b,sum);
            sum=0;
        }
        
        
       
        return sum1;
    }
};
221671