<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:


    bool check_palindrome(std::string s, int l, int r){
  int mid = l+(r-l)/2;
  int n = r-l+1; 
  for(int i=0;i<n/2;i++){
    if(s[l+i]!= s[r-i])return false;
  }

  return true;
}

int count_palindrome(std::string s, int r){

  int ans = 0; 
  for(int i=0;i<=r;i++){
    if(check_palindrome(s,i,r)){
      ans++;
    }
  }

  return ans;
}


int countSubstrings(std::string s) {
  int n = s.length();
  std::vector<int> dp(n+1,0);
  for(int i=0;i<n;i++){
    dp[i+1] = dp[i]+ count_palindrome(s,i);
  }

  return dp[n];
}
};
393009