Medium Problemsstringoptimization
Longest Common Increasing Subsequence
Given two arrays, find the length of the longest sequence of values that is simultaneously a common subsequence of both arrays and strictly increasing.
Do this lesson first: longest common subsequenceThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself. That is the whole exercise.