Return the length of the longest strictly increasing subsequence of nums. Target O(n log n).
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial