Longest Continuous Increasing Subsequence at Yandex

Problem Description

Given an unsorted array of integers `nums`, return _the length of the longest**continuous increasing subsequence** (i.e. subarray)_. The subsequence must be **strictly** increasing. A **continuous increasing subsequence** is defined by two indices `l` and `r` (`l < r`) such that it is `[nums[l], nu...

Topics

Also asked at 4 companies