Leetcode Problem 1493. Longest Subarray of 1's After Deleting One Element

1493. Longest Subarray of 1's After Deleting One Element

Leetcode Solutions

Initialize zeroCount to 0, longestWindow to 0, and start to 0.
Iterate over the array with index i.
Increment zeroCount if nums[i] is 0.
While zeroCount is greater than 1, increment start and decrement zeroCount if nums[start] is 0.
Update longestWindow with the maximum of its current value and i - start.
Return longestWindow.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen