Problem 73 of 333MediumCodingP073

Longest increasing subsequence

Given an array, find the length of the longest strictly increasing subsequence. $O(n \log n)$ .
See the hint and solution with a free account
Every problem on Quant Engine is free, with a hint and a full worked solution. Making an account takes 30 seconds and no card. Then you can see them and track what you have solved.
Create a free account Log in

See the hint and solution with a free account