Practice Longest Subarray of 1's After Deleting One Element
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#1493
LeetCode ProblemLongest Subarray of 1's After Deleting One Element
Problem Statement
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.
Source: Longest Subarray of 1's After Deleting One Element on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,1,0,1]
Output
3
# Example 2
Input
nums = [0,1,1,1,0,1,1,0,1]
Output
5
# Example 3
Input
nums = [1,1,1]
Output
2
Constraints
1 <= nums.length <= 10^5
nums[i] is either 0 or 1.
Related LeetCode Problems
Practice more problems similar to Longest Subarray of 1's After Deleting One Element.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.