Distinct palindromic substrings

Handle	Score
@Ibrahim Nash	6379
@blackshadows	6329
@mb1973	5376
@Quandray	5231
@akhayrutdinov	5111
@saiujwal13083	4510
@sanjay05	3762
@marius_valentin_dragoi	3522
@sushant_a	3459
@verma_ji	3357
@KshamaGupta	3318
Complete Leaderboard
Handle	Score
@184025	110
@terabaap123	97
@arshjit_singh7	92
@anamikaprasad124	92
@kumsachin10	90
@vaibhavinayak	75
@NullPointerException	74
@TanmayJ	74
@ronaldo77	72
@bhupindersingh25122001	68
@ritiksethi21	68
Complete Leaderboard

Hard Accuracy: 49.76% Submissions: 10170 Points: 8

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

Company Tags

Linkedin MakeMyTrip Ola Cabs SAP Labs

Topic Tags

Dynamic Programming Palindrome STL Strings

Related Interview Experiences

Ola interview experience set 11 internship Makemytrip interview experience set 7 on campus

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Distinct palindromic substrings

Loading...

Editorial

All Submissions

My Submissions:

Output Window

Message

Loading...

Editorial

All Submissions

My Submissions:

Output Window

Select Operation Mode