Longest Common Subsequence
Longest Common Subsequence
HardDynamic Programming33% accepted
Compute the length of the longest common subsequence between two strings using dynamic programming.
Approach
Read two strings and print the length of their longest common subsequence.
Input
ABCBDAB
BDCABA
Output
4
More Dynamic Programming problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards