78 / 78 test cases passed, but took too long.
	Status: Time Limit Exceeded
	
Submitted: 4 minutes ago

class Solution:
    def minMeetingRooms(self, intervals: List[List[int]]) -> int:
        rooms = []
        intervals.sort()
        for interval in intervals:
            if len(rooms) == 0:
                rooms.append([interval])
            else:
                added = False
                for room in rooms:
                    conflict = False
                    for block in room:
                        if (interval[0] >= block[0] and interval[0] < block[1]) or (interval[1]>block[0] and interval[1]<=block[1]):
                            conflict = True
                    if not conflict:
                        room.append(interval)
                        added = True
                        break
                if not added:
                    rooms.append([interval])
                    
        print(intervals)
        print(len(rooms))
        return(len(rooms))