Medium LeetCode Problem | Dataford Interview Questions

Your question is Medium LeetCode Problem. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Binance processes a chronological stream of account events, where 1 represents a rejected event and 0 represents an accepted event. Given the stream and an integer k, find the length of the longest contiguous window containing at most k rejected events.

You may remove any number of events from the beginning or end of the stream, but the remaining events must stay contiguous. Return only the maximum window length.

Formal Specification

Implement longest_stable_window(events, k).

Input: events, a list of integers containing only 0 and 1, and k, a non-negative integer.
Output: An integer representing the maximum length of a contiguous subarray with at most k values equal to 1.

Constraints

1 <= len(events) <= 10^5
events[i] is either 0 or 1
0 <= k <= len(events)

Function Signature

def longest_stable_window(events, k):