Conquer the JavaScript Interview: Longest Common Subsequence (LCS) [Beginner Skill Level]

[@katyadolgov3254]

Oh thanks! I was very surprised when I saw the solution to this problem, and you explained everything to me

[@RAMII19780529]

For some reason I thought when there was a match you took the number from the diagonal (i - 1 and j - 1). Edit: The code does it right, it was the visual that was confusing.