Leetcode 2933. High-Access Employees

Given timestamped accesses per employee, find all employees who made three or more accesses within any one-hour period (accesses exactly 60 minutes apart do not count). The core challenge is grouping times by employee and detecting any triple inside a 60-minute window—usually solved by sorting each person's times and using a sliding-window/two-pointer check.

Question Timeline

Company: PayPal
Level: All Levels
Region: All Regions
Date Asked: Late February, 2026

We are working on a security system for a badged-access room in our company's building.
We want to find employees who badged into our secured room unusually often. We have an unordered list of names and entry times over a single day. Access times are given as numbers up to four digits in length using 24-hour time, such as "800" or "2250".

Write a function that finds anyone who badged into the room three or more times in a one-hour period. Your function should return each of the employees who fit that criteria, plus the times that they badged in during the one-hour period. If there are multiple one-hour periods where this was true for an employee, just return the earliest one for that employee.