Longest Increasing Consecutive Subsequence

In this problem, we have to find the Longest Increasing Consecutive Subsequence in N elements. We can solve this problem efficiently using Dynamic Programming in O(N) time.

Table of contents:

Problem Statement: Longest Increasing Consecutive SubsequenceBrute Force approachImproved Naive approachDynamic Programming approach

In summary, the approach are:

Sorting AlgorithmTime complexitySpace complexityBrute Force approachO(N * 2N)O(1)Improved Naive approachO(N2)O(N)Dynamic...