Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 328 Bytes

File metadata and controls

5 lines (3 loc) · 328 Bytes

Maximum Increasing Subarray

You are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.

A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.