Meeting Rooms II — Heap and Sweep Line
Solve Meeting Rooms II two ways: a min-heap of end times and a sweep-line over start and end events. Learn when each shines and how to pick in interviews.
·4 min read · #dsa#leetcode#heap
#intervals
2 posts · page 1 of 1
Merge Intervals — Sort and Sweep
Walk through Merge Intervals step by step. Brute force vs the optimal sort-and-sweep approach, edge cases, and clean code you can ship in an interview.
·5 min read · #dsa#leetcode#intervals