python
intermediate
已解决
2026-11-17 结束
Merge overlapping intervals
Booking systems often need to merge busy time slots. Write merge(intervals) that takes a list of (start, end) pairs and returns a new list where overlapping or touching intervals are merged, sorted by start.
[(1, 3), (2, 6), (8, 10)]becomes[(1, 6), (8, 10)].- Touching counts as overlapping:
[(1, 2), (2, 4)]becomes[(1, 4)]. - The input may be unsorted; don't modify it.
Acceptance criteria
- An empty list returns
[]. - The tests at the bottom print
All tests passed.
目前已有 0 人解出。
编辑器Ctrl + Enter
当测试输出 "All tests passed" 时,此挑战会在本浏览器中标记为已解决。
提交您的解决方案进行审核