Available question text
Design an event processor for an unbounded stream where each event has an id, timestamp, payload string, and checksum, with events potentially arriving out of order. Validate events by checksum, drop late events beyond a 60-second window, handle duplicates, and continuously maintain the average payload length over the latest 60 seconds in O(n log n) time across n events.
Related questions
Continue with questions that share topics or the same question type.
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Implement a rate limiter using the sliding window log algorithm
Coding
- Leetcode Hard question: Sliding Window Maximum
Coding
- Leetcode medium sliding window question
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Box
Design a Sliding-Window Event Stream Processor with Checksum Validation and Average Payload Length
Reported Apr 13, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source