Count and total · Medium
Busiest hour
A shop logs each customer visit as a time "HH:MM".
Task
Write a prompt that finds the hour with the most visits.
Output format
<HH>:00,<visits>
- An hour means HH:00 to HH:59.
- If hours tie, give the earliest.
Your prompt must contain {input}: it is replaced by each test case, just like the hidden tests in a hiring test.
Sample case 1
Input
09:15 09:40 10:05
Output
09:00,2
Sample case 2
Input
13:00 13:59 14:00 14:30
Output
13:00,2
There are 4 test cases in all; the others are like hidden tests: work out what tricky inputs they might use!