Longest Increasing Subsequence NlogN | Leetcode

[@heybeachMIN]

dmn, after your explanation it was so easy to understand, thanks a lot!!! :)

[@liveurlife3166]

Understood sir.

[@apbh]

Thank you!

[@pratyushshrivastav8530]

We can find out the length of the LIS but the elements involved in the LIS might not always be true with this solution. for input { 2,4,6,8,1} the LIS will be {2,4,6,8} but the nlogn solution will give us the LIS as {1,4,6,8} which is not correct. The nlogn solution can only be used when we require only the length of the LIS and not the elements involved in it.

[@techdose4u]

Yes correct. Its only for finding length of LIS.

[@Divya-qt1cf]

Wow 🎉