Longest Continuous Increasing Subsequence

EasySliding Windowsliding window

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

Given an unsorted integer array nums, find the length of the longest **contiguous** run of elements in which each element is strictly greater than the one before it. Return that length. Any single element is a run of length 1, and equal neighbours end a run (the increase must be strict). Solve it in one O(n) pass.

Examples

Input: nums = [1,3,5,4,7]
Output: 3
[1,3,5] is the longest strictly increasing contiguous run; [1,3,5,7] is not contiguous.
Input: nums = [2,2,2,2,2]
Output: 1
No two neighbours increase strictly, so the best run is one element.

Constraints

  • 1 <= nums.length <= 10^4
  • -10^9 <= nums[i] <= 10^9
  • The run must be contiguous and strictly increasing.

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More sliding window problems