<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 isPalindrome(string s, int low, int high){
        if(low < 0 || high >= s.length()){
            return false;
        }
        
        if(s[low] == s[high]){
            return true;
        }
        return false;
    }

    int countSubstrings(string s){
        int numPalindromes = 0;

        int low = 0;
        int high = 0;
        for(int i = 0; i < s.length(); i++){
            low = i;
            high = i;
            while(isPalindrome(s, low, high)){
                low--;
                high++;
                numPalindromes++;
            }
        }

        for(int i = 0; i < s.length()-1; i++){
            low = i;
            high = i+1;
            while(isPalindrome(s, low, high)){
                low--;
                high++;
                numPalindromes++;
            }
        }
        return numPalindromes;
    }
};
198826