Problem 17 of 75

Longest Subarray of 1s After Deleting One Element

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

Given a binary array nums, you must delete exactly one element from it. Return the size of the longest non-empty subarray containing only 1s in the resulting array (0 if there is no such subarray).

[1,1,0,1] → 3 [0,1,1,1,0,1,1,0,1] → 5 [1,1,1] → 2

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Longest Subarray of 1s After Deleting One Element, explainedcodestorywithMIK