Skip to content

problem7.md

Latest commit

 

History

History
16 lines (12 loc) · 455 Bytes

problem7.md

File metadata and controls

16 lines (12 loc) · 455 Bytes

Problem 7: The Longest Rising Tide (Longest Increasing Subsequence)

Problem Statement

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

Input Format

  • An array of integers nums.

Constraints

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

Example

Input: nums = [10, 9, 2, 5, 3, 7, 101, 18]
Output: 4
Explanation: The longest increasing subsequence is [2, 3, 7, 101].