#899Medium#29 in ByteDance's list· asked at 28 companies
Longest Increasing Subsequence
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [10,9,2,5,3,7,101,18] Output: 4
One LIS is [2,3,7,101].
Example 2
Input: nums = [0,1,0,3,2,3] Output: 4
Example 3
Input: nums = [7,7,7,7,7,7,7] Output: 1
Constraints
- •
1 <= nums.length <= 2500 - •
-10^4 <= nums[i] <= 10^4