🧠 Before you code — what pattern fits?
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
🎬 Video explanation · codestorywithMIK
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.