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

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

Explore how to apply the sliding window method to solve the longest subarray of 1s problem after deleting exactly one element. Understand the use of two pointers and zero counting to dynamically maintain subarrays, optimizing your approach for coding interviews.

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