Count Palindromic Subsequences

easy
Question Solve Solutions 
1.Given a String 'S'.
  2.You have to find count of Palindromic Subsequence of a String.
  3.Your task is to complete the function countPalindromicSubsequences()
  4.The function should print the count of all palindromic subsequences.

Input Format

A single line containing a String

Output Format

Print the number of palindromic subsequences

Constraints

1<=length of string str <=30

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
abcd
Output
4
Previous
Longest Bitonic Subsequence
Next
Longest Common Subsequence

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations easy Edit Distance