Longest Palindromic Subsequence - Video Solutions

MediumStringDynamic Programming

Longest Palindromic Substring - Python - Leetcode 5

8:11629,123 views

10 video solutions available

Longest Palindromic Subsequence - Video Solution

Watch 10 video solutions for Longest Palindromic Subsequence, a medium level problem involving String, Dynamic Programming. This walkthrough by NeetCode has 629,123 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.

Problem Statement

Given a string s, find the longest palindromic subsequence's length in s.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Example 1:

Input: s = "bbbab"
Output: 4
Explanation: One possible longest palindromic subsequence is "bbbb".

Example 2:

Input: s = "cbbd"
Output: 2
Explanation: One possible longest palindromic subsequence is "bb".

Constraints:

1 <= s.length <= 1000
s consists only of lowercase English letters.

Read full problem with examples

Continue Learning

Practice this problem

Solve it on FleetCode

Read Solution & Explanation

Detailed text walkthrough

Longest Palindromic Subsequence - Video Solutions

Longest Palindromic Substring - Python - Leetcode 5

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

Longest Palindromic Substring Manacher's Algorithm

Longest Palindromic Subsequence

DP 28. Longest Palindromic Subsequence

Longest Palindromic Subsequence | Dynamic Programming | Set 12 | GeeksforGeeks

Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms

Longest Palindromic Subsequence - Leetcode 516 - Python

Unique Length-3 Palindromic Subsequences - Leetcode 1930 - Python

Longest Palindromic Subsequence | Recursion | Memo | Bottom Up | Leetcode 516

Longest Palindromic Subsequence - Video Solution

Problem Statement

Continue Learning

Longest Palindromic Subsequence - Video Solutions

Longest Palindromic Substring - Python - Leetcode 5

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

Longest Palindromic Substring Manacher's Algorithm

Longest Palindromic Subsequence

DP 28. Longest Palindromic Subsequence

Longest Palindromic Subsequence | Dynamic Programming | Set 12 | GeeksforGeeks

Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms

Longest Palindromic Subsequence - Leetcode 516 - Python

Unique Length-3 Palindromic Subsequences - Leetcode 1930 - Python

Longest Palindromic Subsequence | Recursion | Memo | Bottom Up | Leetcode 516

Longest Palindromic Subsequence - Video Solution

Problem Statement

Continue Learning