Dsa
Sliding Window
Medium
Longest Increasing Subarray
Given an unsorted array of integers, find the length of the longest increasing subarray. A subarray is increasing if its elements are in strictly increasing order.
Input:
- A single line containing n (1 <= n <= 100,000) integers.
Output:
- Print the length of the longest increasing subarray.
Example:
Input:
1 3 5 4 7
Output:
3
Key concepts
sliding_windowarraysubarray
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now