Distinct palindromic substrings | Practice

Handle	Score
@Ibrahim Nash	5725
@blackshadows	5685
@akhayrutdinov	5111
@mb1973	4989
@Quandray	4908
@saiujwal13083	4156
@sanjay05	3762
@marius_valentin_dragoi	3511
@sushant_a	3453
@KshamaGupta	3318
@the_coder95	3302
Complete Leaderboard
Handle	Score
@shashi1iitk	398
@Suniti Jain	114
@ankish2000nayak	104
@gopalsethlnct	94
@senthil1185	90
@esmadhan	90
@gyanadipta07	89
@satwikdash2000	85
@varunmishra3040	83
@gamec1634	82
@pj_1721	80
Complete Leaderboard

Handle

Score

5725

5685

5111

4989

4908

4156

3762

@marius_valentin_dragoi

3511

@sushant_a

3453

@KshamaGupta

3318

@the_coder95

3302

Complete Leaderboard

Distinct palindromic substrings

Hard Accuracy: 48.31% Submissions: 9675 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

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