Skip to content

Latest commit

 

History

History
12 lines (7 loc) · 442 Bytes

File metadata and controls

12 lines (7 loc) · 442 Bytes

Daily Coding Problem

Note: Continuous improvements and bug fixes are made within the repository to produce better solutions.

Day 21

Given an array of time intervals (start, end) for classroom lectures (possibly overlapping), find the minimum number of rooms required. For example, given [(30, 75), (0, 50), (60, 150)], you should return 2.

This problem was asked by Snapchat.

Solution | Tests