<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:
        plaid = {}
        for i in range(len(s)):
            plaid[i] = {}
        def isPalid(i,j):
            if i in plaid and j in plaid[i]:
                return plaid[i][j]
            ans = False
            if i == j:
                ans = True
            elif i+1 == j:
                ans = s[i] == s[j]                
            elif isPalid(i+1,j-1) and s[i] == s[j]:
                ans = True
            plaid[i][j] = ans
            return ans
        
        for i in range(len(s)):
            for j in range(i,len(s)):
                isPalid(i,j)

        count = 0
        for k,v in plaid.items():
            for kk, vv in v.items():
                if vv:
                    count += 1
        return count

123508