Given a string of lowercase ASCII characters, find all distinct continuous palindromic sub-strings of it.
Input:
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.
Output:
Print the count of distinct continuous palindromic sub-strings of it.
Constraints:
1<=T<=10^5
1<=length of string<=10^5
Example:
Input:
2
abaaa
geek
Output:
5
4
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.
| PM_Pranay | 38 |
| m_raju | 22 |
| Piyush_43 | 22 |
| abducodes | 22 |
| RamduttSharma | 18 |
| Pulkit__Sharma__ | 626 |
| Anirban166 | 503 |
| abducodes | 468 |
| Found_me | 430 |
| Yo_Nehru | 404 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4559 |