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

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

Explore how to use the sliding window pattern to solve for the longest subarray of 1s after deleting exactly one element from a binary array. Understand the approach of maintaining a window with at most one zero, dynamically adjusting the window boundaries, and applying two-pointer technique to achieve an optimal linear time solution.

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