A company security system records badge access logs. You are given two string arrays keyName and keyTime, where keyName[i] and keyTime[i] correspond to the name of an employee and the time they used their keycard on a single day.

All access times are formatted as “HH:MM” in $24$ hour time.

An alert is raised for an employee if that employee uses their keycard $3$ or more times within any rolling one hour window (which means the time difference between the first and the third use is at most $60$ minutes).

Return a list of all unique employee names who received an alert, sorted in ascending lexicographical order.

Constraints:

• $1 \leq$ keyName.length, keyTime.length $\leq 10^5$

• keyName.length $==$ keyTime.length

• keyTime[i] is in the format “HH:MM”.

• [keyName[i], keyTime[i]] is unique.

• $1 \leq$ keyName[i].length $\leq 10$

• keyName[i] contains only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.