## Problem Given an integer array, find the length of the longest contiguous subarray where no two adjacent elements are equal. ```python from typing import List def longest_unequal_subarray(nums: List[int]) -> int: pass ``` **Example:** ``` Input: [1, 2, 2, 3, 4, 3, 3, 5] Subarrays with no adjacent equal: [1,2] len=2 [2,3,4,3] len=4 <- longest [3,5] len=2 Output: 4 ``` ## Approach Single pass: maintain `curr_len`. When `nums[i] != nums[i-1]`, increment `curr_len`; otherwise reset to 1 (current element starts a new run). Track max. Time: O(n), Space: O(1). ## Follow-ups 1. What if the constraint is "no two elements within distance `k` are equal"? How does the algorithm change? 2. How would you find the starting index of the longest such subarray, not just its length? 3. What if you are allowed to remove at most one element to maximize the length? 4. How would you solve this in a streaming context where the array is too large to hold in memory?

InterviewDB Question

Unequal Elements: Find the Longest Subarray Where No Two Adjacent Elements Are Equal

Question Details

Problem Given an integer array, find the length of the longest contiguous subarray where no two adjacent elements are equal. Example: Approach Single pass: maintain curr_len. When nums[i] != nums[i-1], increment curr_len; otherwise reset to 1 (curren…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding Oa

More from Snowflake

Reddit Snowflake screening interviews coming up — system design + coding questions? 1p3a Snowflake 2026 Software Engineer Intern VO Interview Experience 1p3a Snowflake SWE AI/ML Intern Online Assessment Problems Reddit Tips Systems Role Snowflake Reddit Posting Again: Did I mess this up or do I still have a shot? (Data Analyst Interview Experience)

← All Snowflake questions Snowflake Software Engineer Questions → All Arrays Questions →