Skip to interview prep
Apexed

371. Find the length of the longest strictly increasing subsequence in O(n²) and in O(n log n).

MediumDynamic programming

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Find the length of the longest strictly increasing subsequence in O(n²) and in O(n log n). — Data structures & algorithms interview question — Apexed