Longest Continuous Increasing Subsequence — easy DSA Problem

Longest Continuous Increasing Subsequence

easy

arrays

two pointers

amazon

google

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

Example 1:

Input: 1 3 5 4 7
Output: 3

Example 2:

Input: 2 2 2 2
Output: 1

Input format: Space-separated integers.

Output format: Length of LCIS.

Run to check your code against the sample cases, or submit to run every case