Add 'Meeting Rooms'

Author: nickolashkraus

README.md

@@ -62,6 +62,8 @@ A collection of LeetCode solutions
 
 [Maximum Subarray](./src/maximum_subarray.py)
 
+[Meeting Rooms](./src/meeting_rooms.py)
+
 [Merge Intervals](./src/merge_intervals.py)
 
 [Merge k Sorted Lists](./src/merge_k_sorted_lists.py)

src/meeting_rooms.py

@@ -0,0 +1,19 @@
+"""
+252. Meeting Rooms
+
+https://leetcode.com/problems/meeting-rooms
+
+NOTES
+  * Simply sort and check for overlapping intervals.
+"""
+
+
+class Solution:
+    def canAttendMeetings(self, intervals: list[list[int]]) -> bool:
+        if not intervals:
+            return True
+        intervals.sort(key=lambda x: x[0])
+        for i in range(len(intervals) - 1):
+            if intervals[i][1] > intervals[i + 1][0]:
+                return False
+        return True

tests/test_meeting_rooms.py

@@ -0,0 +1,19 @@
+"""
+252. Meeting Rooms
+
+https://leetcode.com/problems/meeting-rooms
+"""
+
+from unittest import TestCase
+
+from src.meeting_rooms import Solution
+
+
+class TestSolution(TestCase):
+    def test_1(self):
+        exp = False
+        assert Solution().canAttendMeetings([[0, 30], [5, 10], [15, 20]]) == exp
+
+    def test_2(self):
+        exp = True
+        assert Solution().canAttendMeetings([[7, 10], [2, 4]]) == exp