Longest Continuous Increasing Subsequence

Easy•array•Expected: O(n) time, O(1) space•Interview Context

Problem

Given an unsorted array, find the length of the longest continuous increasing subsequence.

Language: