Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

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

My accepted Python solution to LeetCode problem 1586, Longest Subarray of 1's After Deleting One Element, running in 63ms.

  • Difficulty: Medium
  • Python
  • Runtime 63ms
  • Memory 22.3MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 63ms, memory 22.3MB, accepted 2025-12-30.

python
class Solution:
    def longestSubarray(self, nums: List[int]) -> int:
        left = 0
        zeros = 0
        max_len = 0
        
        for right in range(len(nums)):
            if nums[right] == 0:
                zeros += 1
            
            while zeros > 1:
                if nums[left] == 0:
                    zeros -= 1
                left += 1
            
            max_len = max(max_len, right - left)
        
        return max_len

Source