|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Given a string, the task is to count all palindromic sub-strings present in it.
The first line of input will contain no of test cases T . Then T test cases follow . Each test case contains 2 lines. The first line of each test case contains an integer N denoting the length of the string, next line of test case contains the string
For each test case output a single line depecting the number of palindromic substrings present.
Test Case 1
Input : str = "abaab"
All palindrome substring are : "aba" , "aa" , "baab"
Test Case 2
Input : str = "abbaeae"
All palindrome substring are : "bb" , "abba" ,"aea","eae"