Sliding Window

If the window is valid, expand right.
Else, shrink left.

O(n)

Python | Java

Maintain a valid window at the end of each outer for loop
to find the longest subsequence.

LeetCode

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

Python | Java

• Relevant Problems

  https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/

  https://leetcode.com/problems/search-insert-position/

  https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/

  https://leetcode.com/problems/first-bad-version/

  https://leetcode.com/problems/find-smallest-letter-greater-than-target/

  https://leetcode.com/problems/sqrtx/

  https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/

  https://leetcode.com/problems/random-pick-with-weight/

  https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/

  https://leetcode.com/problems/koko-eating-bananas/

  https://leetcode.com/problems/split-array-largest-sum/

  https://leetcode.com/problems/divide-chocolate/

  https://leetcode.com/problems/missing-element-in-sorted-array/