Leetcode 1143. Longest Common Subsequence
Find the length of the longest sequence of characters that appears in both input strings in the same relative order (not necessarily contiguous). This is the classic LCS problem, typically solved with dynamic programming in O(n*m) time for string lengths up to 1000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.