Meeting Rooms II

LeetCode Link

Problem Description

Visit LeetCode for the full problem description.

---

Solutions

Solution 1: C# (Best: 108 ms)

Metric	Value
Runtime	108 ms
Memory	27 MB
Date	2020-03-18

Solution

public class Solution {
    public int MinMeetingRooms(int[][] intervals) {
        int[] starts = intervals.Select(x=>x[0]).ToArray();
    int[] ends = intervals.Select(x=>x[1]).ToArray();
    
    Array.Sort(starts);
    Array.Sort(ends);
    
    int rooms = 0, endItr = 0;
    for (int i = 0; i < starts.Length; i++)
    {
        if(starts[i]<ends[endItr])
        {
            rooms++;
        }
        else{
            endItr++;
        }
    }
    
    return rooms;
    }
}

---

Complexity Analysis

Approach	Time	Space
Solution	To be analyzed	To be analyzed