Longest Increasing Subsequence [3 techniques]

As the name suggest Longest Increasing Subsequence is to find the longest increasing subsequence in sequence such that elements of subsequence are in sorted increasing order.

Approcah to Solve this problem:
Longest Increasing Subsequence problem can be solved with the help of 3 different Approach:

Brute ForceDynamic ProgrammingBinary SearchTime Complexity

Time Complexity of LIS:

Brute force: O(N^2)Dynamic Programming: O(n^2)Binary Search: O(nlogn)

Using Binary Search is a efficient Meth...