406. Longest Subarray of Ones

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

Example:
Input: nums = [1,1,0,1] Output: 3

Run this challenge interactively in Python or JavaScript when the app loads.