▲
×
Timer is Running


Distinct palindromic substrings
Submissions: 9063   Accuracy:

47.33%

  Difficulty: Hard   Marks: 8
Associated Course(s):   Geeks Classes   Geeks Classes- Algorithms
Show Topic Tags          
Company Tags Linkedin  MakeMyTrip  Ola Cabs  SAP Labs 

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

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Ayush Govil
Author: Ayush Govil 1
Editorial


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.