Longest Increasing Subsequence in O(n log n)

← Courses›Interview PrepModule 4 · Dynamic Programming & Heap›Longest Increasing Subsequence in O(n log n)write55 / 100

Task

📝 **Question:** Implement `lis_length(nums)` in O(n log n) using `bisect_left`. Test on [10,9,2,5,3,7,101,18].

📋 Pick the right answer.

💡 **Hint:** Re-read the theory above if unsure.

Keep going

🎯write

Sliding window: minimum window substring

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion