Problem 45474. Sub-sequence - 02
Given two sequences, find the length of the longest common subsequence.
a=[1,1,1,1,1,2,3,1,4] b=[2,3,0,0,9,5,4,1] longest Common subsequence = [2,3,4] = [2,3,1] so,length=3
Solution Stats
Problem Comments
Solution Comments
Show commentsGroup

Algorithm I
- 17 Problems
- 5 Finishers
- Calculate the Levenshtein distance between two strings
- Calculate the Damerau-Levenshtein distance between two strings.
- Coin distribution
- Coin Distribution - 02
- Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
- The Tortoise and the Hare - 01
- The Tortoise and the Hare - 02
- Quarantine Days
- Word Ladder
- Kolakoski Sequence
- Is this group simply connected?
- Sub-sequence - 01
- Sub-sequence - 02
- Sub-sequence - 03
- longest common substring : Skipped character version
- Find an optimal placement of coolers on a grid
- Chain multiplication - 02
Problem Recent Solvers17
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!