InterviewBit Problems   Longest Increasing Subsequence : Solved

Easy Solution for Longest Increasing Subsequence (1)

Solution: O(nlogn) (1)

Can be done with Patience sort (2)

Simple O(n^2) DP solution (1)

LIS using top-down approach (1)

The Complete Solution given is not efficient (2)

Please add to the question description that the list should be striclty increasin (4)