<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 arr, int i, int j)
    {
        while(i <= j)
        {
            if(arr[i] != arr[j]) return false;
            i++, j--;
        }

        return true;
    }

    int findPossiblePalindrome(string arr, int n, int i, int j)
    {
        int ans = 0;
        while(i >= 0 && j < n)
        {
            if(!isPalindrome(arr, i, j)) break;
            i--, j++, ans++;
        }

        return ans;
    }

    int countSubstrings(string s) {
        int ans = 0;
        int n = s.size();
        
        for(int i = 0; i < n; i++) ans += findPossiblePalindrome(s, n, i, i);
        for(int i = 1; i < n; i++) ans += findPossiblePalindrome(s, n, i - 1, i);

        return ans;

    }
};
255939