neilljordan
/ daily-coding-problem-21.rb
Created
July 8, 2019 16:52
— forked from woodRock/daily-coding-problem-21.rb
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 file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Sort jobs by finish times so that f1<=f2<=..<=fn | |
| # π΄ β β , πππ π‘ β 0 | |
| # for π β 1 to π | |
| # if π π β₯ πππ π‘ then π΄ β π΄ βͺ {π}, πππ π‘ β ππ | |
| # return οΏ½ | |
| require('set') | |
| def minimum_room_no(times) | |
| times = times.sort {|a,b| a[1] <=> b[1]} |