Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Longest Subarray of 1's After Deleting One Element

Explore how to identify the longest contiguous subarray of 1's after removing one element from a binary array. Learn to apply the sliding window technique with two pointers to dynamically maintain a valid window containing at most one zero. Understand how this approach optimizes the solution with linear time and constant space complexity.

We'll cover the following...

Statement

Given a binary array nums, remove exactly one element from it. Return the length of the longest non-empty subarray consisting entirely of 11's in the resulting array. If no such subarray exists, return 00.

Note: Exactly one element must always be deleted, even if all elements are 11's.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5 ...