Medium Problemsoptimizationlinear
Longest Increasing Subsequence
Given an array of integers, find the length of the longest subsequence whose values are strictly increasing. The chosen elements must keep their original relative order but need not be adjacent.
Do this lesson first: house robberThe 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.