<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:
    def countSubstrings(self, s: str) -> int:


        # abcbaafa
        
        output = []
        n = len(s)

        for i, c in enumerate(s):
            output.append(c)

            # if i-1 >= 0 and s[i] == s[i-1]:
            #     output.append(s[i-1:i+1])
            right = i+1
            left = i
            while right < n and left >= 0:
                if s[left] == s[right]:
                    output.append(s[i:i+2]) 
                else:
                    break
                left, right = left-1, right+1

            # left = i
            # right = i+1
            # while right < n and left >= 0:
            #     if s[left] == s[right]:
            #         output.append(s[i:i+2]) 
            #     left, right = left-1, right+1

            left = i-1 
            right = i+1
            while left >= 0 and right < n:
                if s[left] == s[right]:
                    output.append(s[left:right+1])
                    left, right = left-1, right+1
                else:
                    break

        # print(output)
        return len(output)
            

121034