The High-Access Employees coding problem tasks you with identifying employees who accessed a secure system multiple times within a short duration. You are given a list of access logs, each containing an employee's name and the time of access (in "HHMM" format). An employee is considered "high-access" if they have three or more access events within any 60-minute window.
Companies like Goldman Sachs and Atlassian ask this to test your ability to process time-series data and group information. It evaluates your mastery of Hash Table interview patterns for grouping and Sliding Window interview patterns for checking intervals. It’s a practical security-monitoring scenario that reflects real-world backend logic.
The problem follows a Grouping, Sorting, and Sliding Window approach:
time[i] - time[i-2] < 60. If this condition is met at any point, the employee is high-access.Employee "Alice" access times: ["1000", "1020", "1050", "1110"].
[600, 620, 650, 670].[600, 620, 650, 670].Always convert time strings to a single unit (like minutes or seconds) immediately. It simplifies the logic from complex time arithmetic to basic integer subtraction.
| Title | Difficulty | Topics | LeetCode |
|---|---|---|---|
| Sort Features by Popularity | Medium | Solve | |
| Invalid Transactions | Medium | Solve | |
| Group Anagrams | Medium | Solve | |
| Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Solve | |
| Before and After Puzzle | Medium | Solve |