|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given a string of lowercase ASCII characters, find all distinct continuous palindromic sub-strings of it.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a string.
Print the count of distinct continuous palindromic sub-strings of it.
1<=length of string<=10^5