Longest Increasing Subsequence · Compound Engineer

Longest Increasing Subsequence

Find the length of the longest strictly increasing subsequence. Keep the smallest possible tail for every length, and binary search that sorted list to place each number.

DSAFreeMediumStep-through playerBy Aayush OstwalSolve on LeetCode ↗
Spotted a mistake in this lesson?Report an issue →