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

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

Explore the sliding window approach to solve problems involving binary arrays by learning how to find the longest subarray of 1s after deleting exactly one element. Understand how to maintain dynamic window boundaries, track zero occurrences, and optimize the solution with linear time complexity for efficient coding interview problem-solving.

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 ...