Problem of The Day: Longest Subarray of 1’s After Deleting One Element

Problem Statement

leetcode problem link

My Solution [Accepted]

class Solution:
    def longestSubarray(self, nums: List[int]) -> int:
        res = 0
        l, r = 0, 0
        curr = 0
        N = len(nums)
        for r in range(N):
            if nums[r] == 0:
                curr += 1
            while curr > 1:
                if nums[l] == 0:
                    curr -= 1
                l += 1
            res = max(res, r - l)

        return res

Editorial

Approach: Sliding Window

class Solution {
public:
    int longestSubarray(vector<int>& nums) {
        // Number of zero's in the window.
        int zeroCount = 0;
        int longestWindow = 0;
        // Left end of the window.
        int start = 0;

        for (int i = 0; i < nums.size(); i++) {
            zeroCount += (nums[i] == 0);

            // Shrink the window until the count of zero's
            // is less than or equal to 1.
            while (zeroCount > 1) {
                zeroCount -= (nums[start] == 0);
                start++;
            }

            longestWindow = max(longestWindow, i - start);
        }

        return longestWindow;
    }
};