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

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

Leetcode Solutions

Sliding Window Approach to Find the Longest Subarray of's After Deleting One Element

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

Prefix Sum with Hash Map Approach to Find the Longest Subarray of's After Deleting One Element

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...