codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsMeeting Rooms II

Meeting Rooms II

Medium
SortingGreedyHeaps

Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required.

 

Example 1:

Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2

Example 2:

Input: intervals = [[7,10],[2,4]]
Output: 1

 

Constraints:

  • 1 <= intervals.length <= 104
  • 0 <= starti < endi <= 106

Related Problems

View all
Binary Search
Easy•Sorting-searching
Search a 2D Matrix
Medium•Sorting-searching
Koko Eating Bananas
Medium•Sorting-searching
Find Minimum in Rotated Sorted Array
Medium•Sorting-searching
Search in Rotated Sorted Array
Medium•Sorting-searching
Time Based Key-Value Store
Medium•Sorting-searching
Input:
intervals = [[0,30],[5,10],[15,20]]