Meeting Rooms II (LeetCode 253)

Given an array of meeting time interval objects consisting of start and end times [[start1,end1],[start2,end2],...] (starti < endi), find the minimum number of meeting rooms required to schedule all meetings without any conflicts.