Fixed-Window Packet Rate Limit

Problem

Given a non-decreasing array of integer timestamps timestamps and an integer window_size, return an array where each element is the number of events that occurred within the inclusive time window [timestamps[i] - window_size + 1, timestamps[i]]. Implement an efficient algorithm that processes the timestamps in one pass.

Constraints

• 1 <= len(timestamps) <= 10^5
• 0 <= timestamps[i] <= 10^9
• timestamps is sorted in non-decreasing order
• 1 <= window_size <= 10^9