Tap here to switch tabs
Problem
Submissions

Problem: Longest Continuous Increasing Subsequence

Longest Continuous Increasing Subsequence asks you to find the length of the longest contiguous portion of an integer array whose values strictly increase from one element to the next.

Statement

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

A continuous strictly increasing subsequence is defined by a contiguous range of indices from ll to rr inclusive, where l≤rl \leq r, such that nums[i] < nums[i + 1] for all l≤i<rl \leq i < r. The length of this subsequence is r−l+1r - l + 1.

Constraints:

  • 1≤1 \leq nums.length ≤104\leq 10^4

  • −109≤-10^9 \leq nums[i] ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Longest Continuous Increasing Subsequence

Longest Continuous Increasing Subsequence asks you to find the length of the longest contiguous portion of an integer array whose values strictly increase from one element to the next.

Statement

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

A continuous strictly increasing subsequence is defined by a contiguous range of indices from ll to rr inclusive, where l≤rl \leq r, such that nums[i] < nums[i + 1] for all l≤i<rl \leq i < r. The length of this subsequence is r−l+1r - l + 1.

Constraints:

  • 1≤1 \leq nums.length ≤104\leq 10^4

  • −109≤-10^9 \leq nums[i] ≤109\leq 10^9