<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:
    // Function to check if a string is a palindrome
    bool isPal(const string &str) {
        int s = 0;
        int e = str.size() - 1;
        while (s < e) {
            if (str[s] != str[e])
                return false;
            s++;
            e--;
        }
        return true;
    }

    // Helper function to count all palindromic substrings
    void helper(const string &s, int index, int &count) {
        if (index == s.size()) {
            return;
        }
        string pal_string;
        for (int i = index; i < s.size(); i++) {
            pal_string += s[i]; // Build the current substring
            if (isPal(pal_string)) { // Check if the substring is a palindrome
                count++; // Increment count for every palindrome found
            }
        }
        // Recur for the next index
        helper(s, index + 1, count);
    }

    // Function to count palindromic substrings in a given string
    int countSubstrings(const string &s) {
        int count = 0;
        helper(s, 0, count); // Call helper function to populate `count`
        return count; // Return the total count of palindromic substrings found
    }
};
21778