Solution to 300. Longest Increasing Subsequence is inefficient #1081
Description
The python solution here is O(n^2) but can be made O(n log(n)) by replacing the linear search in the inner loop with a binary search. Check out this solution in the discussion.