Search
⌘K
Get Premium
Leetcode 1940. Longest Common Subsequence Between Sorted Arrays
Find the longest sequence of values that appears in both sorted arrays in order (respecting duplicates), i.e., the longest common subsequence between two sorted sequences. Because the inputs are sorted, the problem reduces to matching elements in order (typically via a merge/two‑pointer pattern) to compute the maximal common ordered subsequence.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.