Tap here to switch tabs
Problem
Submissions

Problem: Longest Increasing Subsequence

Longest Increasing Subsequence asks you to find the length of the longest subsequence in an integer array whose values appear in strictly increasing order.

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
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Longest Increasing Subsequence

Longest Increasing Subsequence asks you to find the length of the longest subsequence in an integer array whose values appear in strictly increasing order.

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