Meeting Rooms Problem Minimum Rooms Required in DSA C - Build from Scratch

Meeting Rooms Problem Minimum Rooms Required

📖 Scenario: You are organizing meetings in a company. Each meeting has a start time and an end time. You want to find out the minimum number of meeting rooms needed so that all meetings can happen without overlapping in the same room.

🎯 Goal: Build a program that calculates the minimum number of meeting rooms required given a list of meeting time intervals.

📋 What You'll Learn

Create an array of meeting intervals with exact start and end times

Create a variable to hold the count of meeting rooms needed

Implement the logic to find the minimum number of meeting rooms required

Print the minimum number of meeting rooms required

💡 Why This Matters

🌍 Real World

Scheduling meeting rooms in offices or conference centers to avoid conflicts.

💼 Career

Useful for software engineers working on calendar apps, booking systems, or resource management tools.

1

Create the meeting intervals array

Create an array called intervals of structs with these exact meeting times: {1, 4}, {2, 5}, {7, 9}.

DSA C

#include 

struct Interval {
    int start;
    int end;
};

int main() {
    // Create the intervals array with {1,4}, {2,5}, {7,9}
    // Your code here

Hint

Use an array of struct Interval with the exact values given.

2

Create a variable for minimum rooms

Create an integer variable called minRooms and set it to 0.

DSA C

#include 

struct Interval {
    int start;
    int end;
};

int main() {
    struct Interval intervals[] = {{1, 4}, {2, 5}, {7, 9}};
    int n = 3;
    // Create minRooms variable and set to 0
    // Your code here

Hint

Just create an integer variable minRooms and assign 0.

3

Implement logic to find minimum meeting rooms

Implement the logic to find the minimum number of meeting rooms required. Use two arrays starts and ends to store start and end times, sort them, then use two pointers i and j to count overlapping meetings and update minRooms accordingly.

DSA C

#include 
#include 

struct Interval {
    int start;
    int end;
};

int compare(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}

int main() {
    struct Interval intervals[] = {{1, 4}, {2, 5}, {7, 9}};
    int n = 3;
    int minRooms = 0;
    // Implement logic to find minimum meeting rooms
    // Your code here

Hint

Use sorting and two pointers to count overlapping intervals and update minRooms.

4

Print the minimum number of meeting rooms

Print the value of minRooms using printf.

DSA C

Hint

Use printf("%d\n", minRooms); to print the minimum rooms.