Meeting Rooms II (Min Rooms)

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Meeting Rooms II (Min Rooms)** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Sort + min-heap of end times **Edge Cases to Consider:** - (1) No overlap (1 room) - (2) All overlap (n rooms) - (3) Back-to-back meetings