Find the Longest Continuous Increasing Subsequence

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Find the length of the longest strictly increasing contiguous run in an integer array. The prompt distinguishes a continuous subarray from a non-contiguous subsequence and makes equal-value behavior explicit for a deterministic linear scan.

Read the full Google Software Engineer interview experience this question came from