x
×

Distinct palindromic substrings
Submissions: 3160   Accuracy:

44.84%

  Difficulty: Hard   Marks: 8
Associated Course(s):   Geeks Classes in Noida
Show Topic Tags          
Company Tags MakeMyTrip  Ola Cabs 

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


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

Recent Comments
to report an issue on this page.