Lesson 10 of 10 · 30 min Premium

Longest increasing subsequence

Measure the longest rising sequence hidden in a list, in O(n log n) with binary search.

This problem is part of Premium

Interview-style problems with tests that check the tricky cases, to get you ready for coding interviews.