logoNEURAL COOK
SearchAll PostsTagsNotesAuthor
logoNEURAL COOK

A posts created with Next.js and Tailwind.css

Explore

  • All posts
  • Notes
  • Snippets
  • Tags
  • RSS feed

Connect

instagramtwitterfacebookyoutubelinkedinmailgithub

© 2026 VIKI. All rights reserved.

Built with
Contents
Table Of Contents
2. Add Two Numbers3. Longest Substring Without Repeating Characters5. Longest Palindromic Substring8. String to Integer (atoi)11. Container With Most Water15. 3Sum17. Letter Combinations of a Phone Number19. Remove Nth Node From End of List22. Generate Parentheses33. Search in Rotated Sorted Array34. Find First and Last Position of Element in Sorted Array48. Rotate Image49. Group Anagrams50. Pow(x, n)53. Maximum Subarray54. Spiral Matrix56. Merge Intervals61. Rotate List73. Set Matrix Zeroes74. Search a 2D Matrix75. Sort Colors78. Subsets137. Single Number II138. Copy List with Random Pointer150. Evaluate Reverse Polish Notation151. Reverse Words in a String153. Find Minimum in Rotated Sorted Array155. Min Stack162. Find Peak Element169. Majority Element198. House Robber207. Course Schedule215. Kth Largest Element in an Array227. Basic Calculator II236. Lowest Common Ancestor of a Binary Tree237. Delete Node in a Linked List238. Product of Array Except Self451. Sort Characters By Frequency540. Single Element in a Sorted Array560. Subarray Sum Equals K636. Exclusive Time of Functions875. Koko Eating Bananas1011. Capacity To Ship Packages Within D Days1101. The Earliest Moment When Everyone Become Friends1283. Find the Smallest Divisor Given a Threshold2140. Solving Questions With Brainpower3169. Count Days Without Meetings3481. Apply Substitutions
253. Approach Using Priority Queue253. Meeting Rooms II
Code Scratch/leetcode/medium/meeting rooms ii approach 1

253. Approach Using Priority Queue

2 min read
On this pageIntution
IntutionComplexityCode

# Intution

To determine the minimum number of conference rooms required, we need to track how many meetings are happening at the same time. If a meeting starts after or when another ends, we can reuse the same room.\

A min-heap (priority queue) is perfect for tracking the earliest meeting to end, so we can efficiently check and reuse rooms.

  • We sort all meetings by start time.
  • Then we use a min-heap (priority queue) to track the earliest ending meeting.
  • If a meeting can reuse a room (i.e., its start time is after or equal to the earliest end time), we pop that meeting from the heap.
  • Otherwise, we need a new room.

The size of the heap at any point gives us the number of rooms needed at that time. The maximum size reached is our answer

# Complexity

Space ComplexityTime Complexity
O(N)\text{O}(N)O(N)O(N∗log⁡N)\text{O}(N*\log{N})O(N∗logN)

# Code

public int minMeetingRooms(int[][] meetingIntervals) {
    // Sort the meetings by start time
    Arrays.sort(meetingIntervals, (a, b) -> Integer.compare(a[0], b[0]));
 
    // Min-heap to track end times of ongoing meetings
    PriorityQueue&lt;Integer&gt; ongoingMeetingsEndTimes = new PriorityQueue<>();
 
    int maxRoomsRequired = 0;
 
    for (int i = 0; i < meetingIntervals.length; ++i) {
        int currentStart = meetingIntervals[i][0];
        int currentEnd = meetingIntervals[i][1];
 
        // Free up rooms that have ended before the current meeting starts
        while (!ongoingMeetingsEndTimes.isEmpty() && ongoingMeetingsEndTimes.peek() <= currentStart) {
            ongoingMeetingsEndTimes.poll(); // Room becomes available
        }
 
        // Allocate room for the current meeting
        ongoingMeetingsEndTimes.add(currentEnd);
 
        // Track the max number of rooms used simultaneously
        maxRoomsRequired = Math.max(maxRoomsRequired, ongoingMeetingsEndTimes.size());
    }
 
    return maxRoomsRequired;
}
 
←Previous200. Number of Islands (Approach 1)Next→253. Meeting Rooms II

On this page

IntutionComplexityCode