Count Palindromic Substrings Problem Statement

Given a string STR, determine the total number of palindromic substrings within STR.

Input:

The first line contains an integer 't' representing the number of test cases. For each test case, provide the string STR for counting palindromic substrings.

Output:

For each test case, return a single integer denoting the total count of palindromic substrings.

Example:

Input:

"t" = 1
STR = "abbc"

Output:

5

Explanation:

The palindromic substrings are: ["a", "b", "b", "c", "bb"]. Therefore, the output is 5.

Constraints:

• 1 <= t <= 100
• 0 <= N <= 1000

Here, t is the number of test cases, and N is the length of the string. Time Limit: 1 sec.

Note:

A 'Palindrome' reads the same forward and backward, such as "abba". A 'Substring' is a continuous sequence within a string, like "a", "b", and "abc" in "abc". Function implementation only required, output management is handled externally.