LeetCode 1143: Longest Common Subsequence — Step-by-Step Visual Trace
Medium — Dynamic Programming | String | Two Pointers
The Problem
Find the length of the longest common subsequence (LCS) between two strings, where a subsequence maintains the relative order of characters but doesn't need to be contiguous.
Approach
U...
blog.tracelit.dev2 min read