Find Longest Increasing Continuous Subarray
Company: Google
Role: Data Scientist
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Given an integer array `nums`, return the length of the longest contiguous strictly increasing subarray. Here, "continuous" means the elements must appear next to each other in the original array.
Aim for an `O(n)` time solution and `O(1)` extra space.
Example:
- Input: `[1, 3, 5, 4, 7]`
- Output: `3`
- Explanation: `[1, 3, 5]` is the longest contiguous strictly increasing segment.
Quick Answer: This question evaluates array manipulation, consecutive sequence detection, and algorithmic time/space complexity reasoning for finding the longest contiguous strictly increasing segment.