Longest Increasing Subsequence | Dataford Interview Questions

Solve the Longest Increasing Subsequence problem (LeetCode 300).

Implement length_of_lis(nums), which returns the length of the longest strictly increasing subsequence of an integer array. A subsequence preserves relative order but may omit elements, and equal consecutive values do not increase its length.

Input: nums, a list of integers. Output: an integer representing the maximum subsequence length.

Constraints

1 <= len(nums) <= 2500
-10^4 <= nums[i] <= 10^4
The subsequence must be strictly increasing

Function Signature

def length_of_lis(nums):

Your question is Longest Increasing Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve the Longest Increasing Subsequence problem (LeetCode 300).

Input: nums, a list of integers. Output: an integer representing the maximum subsequence length.

Constraints

1 <= len(nums) <= 2500
-10^4 <= nums[i] <= 10^4
The subsequence must be strictly increasing

Function Signature

def length_of_lis(nums):

Your question is Longest Increasing Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.