Longest Subarray of 1's After Deleting One Element
Medium
Provided a binary array nums, you should delete one element from it.
Produce the size of the longest non-empty subarray containing only 1's in the resulting array. Produce 0 if there is no such subarray.
Example 1
Input: nums = [1,1,0,1]
Output: 3
Explanation: After deleting the number in position 2, [1,1,1] has 3 numbers with value of 1's.
Example 2
Input: nums = [0,1,1,1,0,1,1,0,1]
Output: 5
Explanation: After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1's is [1,1,1,1,1].
Example 3
Input: nums = [1,1,1]
Output: 2
Explanation: You must delete one element.
Constraints
1 <= nums.length <= 10^5nums[i]is either0or1.
Did this problem appear in one of your interviews?
Responses stay private.