Longest Palindromic Subsequences

medium
Question Solve Solutions 
1. You are given a string str.
2. You are required to print the length of longest palindromic subsequence of string str.

Input Format

A string str

Output Format

A number representing the length of longest palindromic subsequence of string str.

Constraints

0 <= str.length <= 10

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
abcgackbc
Output
5
Previous
Maximum Non-overlapping Bridges
Next
Count Palindromic Substrings

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 Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations