Count Palindromic Subsequences
Submissions: 2664   Accuracy:

38.07%

  Difficulty: Medium   Marks: 4

Given a string str, your task is to complete the function countPs which takes a string str as its only argument and returns an integer denoting the no of palindromic subsequence (need not necessarily be distinct) which could be formed from the string str.

Input:
The first line of input contains an integer T, denoting the no of test cases then T test cases follow. Each test case contains a string str.

Output:
For each test case output will be an integer denoting the no of palindromic subsequence which could be formed from the string str.

Constraints:
1<=T<=100
1<=length of string str <=30

Example(To be used only for expected output):
Input:

2
abcd
aab

Output:
4
4

Explanation:

For the first test case
palindromic subsequence are : "a" ,"b", "c" ,"d"

For second test case
palindromic subsequence are :"a", "a", "b", "aa"



 

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

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

Contributor: Amit Khandelwal, Harshit Sidhwa
Author: Shubham Joshi 1


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.