Compute minimum required meeting rooms

Given a list of meeting time intervals [start, end) for many events, determine the minimum number of rooms required so no meetings overlap in the same room. Describe and implement an algorithm using a min-heap of end times, explain its time and space complexity, and compare it with a sweep-line approach using sorted start/end times. Specify how you would handle edge cases such as zero-length meetings, identical start and end times across meetings, and very large input sizes.