Leetcode 674. Longest Continuous Increasing Subsequence
Find the length of the longest contiguous (continuous) strictly increasing subarray in a given integer array. This is typically solved by a single-pass/sweeping-window scan that tracks the current increasing run and the maximum length (O(n) time, O(1) extra space).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.