## Problem Statement:

Given an integer array nums, return the length of the longest strictly increasing subsequence.

A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements.

For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].

Input Format:

Output Format:

Sample Input 1:

Sample Output 1:

Sample input 2:

Sample output 2:

Sample Input 3:

Sample Output 3:

Constraint:

• 1 <= nums.length <= 2500
• -104 <= nums[i] <= 10⁴

# Approach:

To find the LIS for a given sequence nums, we need to return max(nums(i)).
The length of the longest increasing subsequence ending at index i, will be 1 greater than the maximum of lengths of all longest increasing subsequences ending at indices before i. Therefore we can take a sequence of length of nums and solve iteratively where the element at index i be increased by 1 in each iteration.

# Code:

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

--

--

## More from Placewit

Upskilling students for tech placements!

Love podcasts or audiobooks? Learn on the go with our new app.