Open AashishPalSingh opened 4 years ago
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
Done https://practice.geeksforgeeks.org/viewSol.php?subId=cad02403ea89c1094323e4c6457d3807&pid=2284&user=ashishpalsingh
AashishPalSingh
commented
4 years ago
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