Python Program To Find Number Of Palindrome In A String

            /* ............... START ............... */
                

def count_palindromic_substrings(s):
    n = len(s)
    count = 0

    # Create a table to store whether a substring from index i to j is a palindrome.
    is_palindrome = [[False] * n for _ in range(n)]

    # All substrings of length 1 are palindromes.
    for i in range(n):
        is_palindrome[i][i] = True
        count += 1

    # Check for palindromes of length 2.
    for i in range(n - 1):
        if s[i] == s[i + 1]:
            is_palindrome[i][i + 1] = True
            count += 1

    # Check for palindromes of length greater than 2.
    for length in range(3, n + 1):
        for i in range(n - length + 1):
            j = i + length - 1
            if s[i] == s[j] and is_palindrome[i + 1][j - 1]:
                is_palindrome[i][j] = True
                count += 1

    return count

# Example usage:
s = "ababa"
result = count_palindromic_substrings(s)
print("Number of Palindromic Substrings:", result)

                /* ............... END ............... */