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
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.