Hi I'm confused with this error message.

Your path is not the shortest path. Try again!:

[(0,0), (0,1), (0,2), (0,3), (1,3), (2,3), (2,2), (2,1), (3,1), (4,1), (4,2), (4,3), (4,4)] should equal

[(0,0), (0,1), (0,2), (0,3), (1,3), (2,3), (2,2), (2,1), (3,1), (4,1), (4,2), (4,3), (4,4)]

What went wrong with my output?

Hi,
A | 09:00 - 11:30, 13:30 - 16:00, 16:00 - 17:30, 17:45 - 19:00
B | 09:15 - 12:00, 14:00 - 16:30, 17:00 - 17:30
C | 11:30 - 12:15, 15:00 - 16:30, 17:45 - 19:00

I have been wondering why this case should return None if we want to find the available 90-minute meeting.
Isn't 12:15 the time we are looking for?

hi,

Many thanks :)

i just noticed that I misread the prompt!!
It was case-insensitive

Hi,

"aA11" -> 2 # 'a' and '1'

why 2? Isn't it supposed to count ONLY those that appear more than once?