terminal
Elevo
code
Topics
corporate_fare
Companies
history
History
arrow_back Back to Challenges

#300 Longest Increasing Subsequence

Medium Acceptance 0%
Editorial
description

Problem Description

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

checklist Constraints

1 <= nums.length <= 2500
-10^4 <= nums[i] <= 10^4

science Examples

Case #1

In: nums = [10,9,2,5,3,7,101,18]
Out: 4

Case #2

In: nums = [0,1,0,3,2,3]
Out: 4

Mastery Tags

Arrays Binary Search Dynamic Programming

Hiring Companies

Amazon Google Microsoft
code

Integrated IDE

Login to Compile
code_blocks
Coding
psychology
Aptitude