Palindrome Substrings

Given a string, count the number of distinct substrings that are palindromes. A substring is defined as a contiguous sequence of characters within the string. A palindrome is a string that reads the same forwards and backwards. Input: A single line containing the input string. The string will be non-empty and contains only lowercase English letters. Output: A single integer: the count of distinct palindromic substrings. Example: Input: abba Output: 6 Explanation: The distinct palindromic substrings are: "a", "b", "bb", "abba", "bab", and "a".