Peak Event Window by Duration

Problem

Given an array of integer timestamps timestamps and an integer window_size, return the inclusive start and end timestamps of a window of length window_size that contains the maximum number of events. If multiple windows contain the same maximum number of events, return the one with the earliest start time. The input timestamps may be unsorted and may contain duplicates.

Constraints

• 1 <= timestamps.length <= 10^5
• 0 <= timestamps[i] <= 10^9
• 1 <= window_size <= 10^9
• Timestamps are integers