When Hours Collide

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L5

Problem

A shared room-booking calendar stores each reservation as a `[name, start, end]` record, and you need to flag every scheduling collision. Return all pairs of events whose ranges overlap, where each range is half-open [start, end) so an event ending exactly when another begins is not a collision. Report each pair once as `[name_a, name_b]` with the earlier-starting event first, ordered by name_a's start then name_b's start, and return an empty list when nothing collides.

Summary

Two reservations, one slot. Find every clash.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.