Longest Increasing Subsequence

Try to solve the Longest Increasing Subsequence problem.

We'll cover the following

Statement

The Longest Increasing Subsequence (LIS) is the longest subsequence from a given array in which the subsequence elements are sorted in a strictly increasing order. Given an integer array, nums, find the length of the LIS in this array.

Constraints:

  • 1≤1 \leq nums.length ≤1000\leq 1000
  • −104≤-10^4 \leq nums[i] ≤104\leq 10^4

Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.