Another DP problem that is very often used in programming challenge problems is the longest common subsequence (LCS). This problem consists of finding the length of the longest subsequence in two string sequences. The longest subsequence is a sequence that appears in the same relative order but is not necessarily contiguous (not a substring) in both strings.
Consider the following example:
Now, let's take a look at the following algorithm:
function lcs(wordX, wordY) { const m = wordX.length; const n = wordY.length; const l = []; for (let i = 0; i <= m; i++) { l[i] = []; // {1} for (let j = 0; j <= n; j++) { ...
