Diwali Offer!Flat 20% OFF
Enroll Now
PrakalpanaLive online tech training

166. Longest Increasing Subsequence

MediumDay 48 of 60Dynamic Programming

Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence keeps the original order but may skip elements.

Example 1
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
One longest subsequence is [2,3,7,101].
Example 2
Input: nums = [0,1,0,3,2,3]
Output: 4
Constraints
  • 1 <= nums.length <= 2500
  • -10^4 <= nums[i] <= 10^4
Hints
Frequently asked at: Amazon, Microsoft, Google, Meta
Ctrl + Enter runs the examples

Not sure what to learn next?

A 1-on-1 session with an industry mentor and a roadmap built for you. How it works

  1. 1Discuss your goals
  2. 2Get a personal plan
  3. 3Start learning
Book for β‚Ή200/ 30 min