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

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

Explore how to solve the longest subarray of 1's problem after deleting one element using a sliding window approach. Learn to manage window boundaries and track zeros to identify the maximum contiguous run of ones after exactly one deletion, optimizing your coding interview pattern skills.

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