Why Intervals Are a Common Problem Pattern in DSA C++ - Why This Pattern

Mental Model

Intervals represent ranges of values that often overlap or need merging, making them a common pattern in many problems.

Analogy: Think of booking meeting rooms where each meeting has a start and end time; managing these times without conflicts is like handling intervals.

Time line:
0    1    2    3    4    5    6    7    8
|----|----|----|----|----|----|----|----|
Interval A:      [----]
Interval B:           [-------]
Interval C:                [--]

Dry Run Walkthrough

Input: Intervals: [1,3], [2,6], [8,10], [15,18]

Goal: Show how overlapping intervals merge to form combined intervals

Step 1: Sort intervals by start time

[1,3] -> [2,6] -> [8,10] -> [15,18]

Why: Sorting helps process intervals in order to detect overlaps easily

Step 2: Start with first interval [1,3] as merged list

Merged: [1,3]

Why: Initialize merged intervals with the earliest interval

Step 3: Compare next interval [2,6] with last merged [1,3]; they overlap, so merge to [1,6]

Merged: [1,6]

Why: Overlapping intervals combine to cover full range without gaps

Step 4: Next interval [8,10] does not overlap with [1,6], add it as new merged interval

Merged: [1,6] -> [8,10]

Why: Non-overlapping intervals remain separate

Step 5: Next interval [15,18] does not overlap with [8,10], add it as new merged interval

Merged: [1,6] -> [8,10] -> [15,18]

Why: No overlap means separate intervals

Result:

Merged intervals: [1,6] -> [8,10] -> [15,18]

Annotated Code

DSA C++

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Interval {
    int start, end;
};

// Function to merge overlapping intervals
vector<Interval> mergeIntervals(vector<Interval>& intervals) {
    if (intervals.empty()) return {};

    // Sort intervals by start time
    sort(intervals.begin(), intervals.end(), [](const Interval& a, const Interval& b) {
        return a.start < b.start;
    });

    vector<Interval> merged;
    merged.push_back(intervals[0]); // start with first interval

    for (int i = 1; i < intervals.size(); i++) {
        // If current interval overlaps with last merged, merge them
        if (intervals[i].start <= merged.back().end) {
            merged.back().end = max(merged.back().end, intervals[i].end);
        } else {
            // No overlap, add current interval
            merged.push_back(intervals[i]);
        }
    }

    return merged;
}

int main() {
    vector<Interval> intervals = {{1,3}, {2,6}, {8,10}, {15,18}};
    vector<Interval> merged = mergeIntervals(intervals);

    for (const auto& interval : merged) {
        cout << "[" << interval.start << "," << interval.end << "] ";
    }
    cout << endl;
    return 0;
}

sort(intervals.begin(), intervals.end(), [](const Interval& a, const Interval& b) { return a.start < b.start; });

sort intervals by start time to process in order

merged.push_back(intervals[0]);

initialize merged list with first interval

if (intervals[i].start <= merged.back().end) { merged.back().end = max(merged.back().end, intervals[i].end); }

merge overlapping intervals by extending end time

else { merged.push_back(intervals[i]); }

add non-overlapping interval as new merged interval

Output

[1,6] [8,10] [15,18] 

Complexity Analysis

Time: O(n log n) because sorting the intervals takes O(n log n) and merging takes O(n)

Space: O(n) to store the merged intervals in the output list

vs Alternative: Naive approach checking every pair for overlap is O(n^2), so sorting plus one pass is more efficient

Edge Cases

empty intervals list

returns empty merged list without error

DSA C++

if (intervals.empty()) return {};

intervals with no overlaps

all intervals remain separate in merged list

DSA C++

else { merged.push_back(intervals[i]); }

intervals fully contained inside others

contained intervals merge into the larger interval

DSA C++

merged.back().end = max(merged.back().end, intervals[i].end);

When to Use This Pattern

When you see problems about ranges, times, or segments that may overlap or need combining, reach for the intervals pattern because sorting and merging simplifies handling overlaps.

Common Mistakes

Mistake: Not sorting intervals before merging, causing incorrect merges
Fix: Always sort intervals by start time before merging

Mistake: Merging intervals incorrectly by not updating the end time properly
Fix: Update the end time to the maximum of overlapping intervals

Summary

It merges overlapping intervals into combined ranges.

Use it when you need to handle overlapping ranges or time slots.

Sorting intervals by start time lets you merge overlaps in one pass.

Practice

1. Why are interval problems common in algorithms and data structures?

easy

A. Because many real-world problems involve ranges or periods of time.

B. Because intervals are easier to sort than other data types.

C. Because intervals always have fixed lengths.

D. Because intervals do not overlap in any problem.

Solution

1. Step 1: Understand the nature of intervals

   Intervals represent ranges, such as time periods or numeric ranges, which appear in many real-world scenarios like scheduling or booking.

2. Step 2: Recognize why intervals are common

   Since many problems require handling overlapping or non-overlapping ranges, intervals become a natural pattern to solve these efficiently.

3. Final Answer:

   Because many real-world problems involve ranges or periods of time. -> Option A

4. Quick Check:

   Intervals model ranges = Because many real-world problems involve ranges or periods of time. [OK]

Hint: Think about real-life ranges like meetings or bookings [OK]

Common Mistakes:

• Assuming intervals always have fixed lengths
• Thinking intervals never overlap
• Believing intervals are only about sorting

2. Which of the following is the correct C++ syntax to represent an interval as a pair of integers start and end?

easy

A. std::pair interval = {start, end};

B. std::vector<int> interval = {start, end};

C. int interval = start, end;

D. std::map interval = {start, end};

Solution

1. Step 1: Identify the correct container for two related integers

   A pair holds exactly two values together, suitable for start and end.

2. Step 2: Check syntax correctness

   std::pair interval = {start, end}; correctly initializes the pair with start and end.

3. Final Answer:

   std::pair interval = {start, end}; -> Option A

4. Quick Check:

   Pair holds two ints = std::pair interval = {start, end}; [OK]

Hint: Use std::pair for two related values like interval ends [OK]

Common Mistakes:

• Using vector which can hold many elements, not just two
• Declaring two ints separated by comma incorrectly
• Using map which is for key-value pairs, not intervals

3. What is the output of the following C++ code that merges overlapping intervals?

std::vector> intervals = {{1,3}, {2,6}, {8,10}, {15,18}};
std::sort(intervals.begin(), intervals.end());
std::vector> merged;
for (auto &interval : intervals) {
  if (merged.empty() || merged.back().second < interval.first) {
    merged.push_back(interval);
  } else {
    merged.back().second = std::max(merged.back().second, interval.second);
  }
}
for (auto &i : merged) {
  std::cout << "{" << i.first << "," << i.second << "} ";
}

medium

A. {1,10} {15,18}

B. {1,3} {2,6} {8,10} {15,18}

C. {1,6} {8,10} {15,18}

D. {1,6} {2,10} {15,18}

Solution

1. Step 1: Sort intervals by start time

   Intervals sorted: {1,3}, {2,6}, {8,10}, {15,18}

2. Step 2: Merge overlapping intervals

   {1,3} and {2,6} overlap, merged to {1,6}. Others remain separate.

3. Final Answer:

   {1,6} {8,10} {15,18} -> Option C

4. Quick Check:

   Merged intervals = {1,6} {8,10} {15,18} [OK]

Hint: Sort intervals first, then merge overlapping ones [OK]

Common Mistakes:

• Not sorting intervals before merging
• Incorrectly merging non-overlapping intervals
• Printing intervals without merging

4. The following code is intended to merge overlapping intervals but has a bug. What is the bug?

std::vector> intervals = {{1,4}, {4,5}};
std::sort(intervals.begin(), intervals.end());
std::vector> merged;
for (auto &interval : intervals) {
  if (merged.empty() || merged.back().second <= interval.first) {
    merged.push_back(interval);
  } else {
    merged.back().second = std::max(merged.back().second, interval.second);
  }
}

medium

A. The max function is used incorrectly.

B. The condition should use '<' instead of '<=' to merge touching intervals.

C. The vector intervals is not sorted before merging.

D. The merged vector is not initialized.

Solution

1. Step 1: Analyze the merging condition

   The condition uses merged.back().second <= interval.first, which treats touching intervals as non-overlapping.

2. Step 2: Correct the condition for merging touching intervals

   Using '<' instead of '<=' merges intervals that touch at endpoints, which is usually desired.

3. Final Answer:

   The condition should use '<' instead of '<=' to merge touching intervals. -> Option B

4. Quick Check:

   Use '<' to merge touching intervals = The condition should use '<' instead of '<=' to merge touching intervals. [OK]

Hint: Use '<' not '<=' to merge intervals that just touch [OK]

Common Mistakes:

• Ignoring touching intervals as overlapping
• Not sorting intervals before merging
• Misusing max function

5. Given a list of intervals representing booked meeting times, how would you find the minimum number of meeting rooms required to hold all meetings without overlap?

hard

A. Sort intervals by end time, merge all intervals, count merged intervals.

B. Count intervals with the longest duration only.

C. Use a stack to push intervals and pop when they overlap.

D. Sort intervals by start time, use a min-heap to track end times, count max simultaneous meetings.

Solution

1. Step 1: Sort intervals by start time

   Sorting helps process meetings in chronological order.

2. Step 2: Use a min-heap to track earliest ending meeting

   Push end times into a min-heap; if a meeting starts after the earliest end, reuse room; else add room.

3. Step 3: Count max simultaneous meetings

   The size of the heap at any time is the number of rooms needed.

4. Final Answer:

   Sort intervals by start time, use a min-heap to track end times, count max simultaneous meetings. -> Option D

5. Quick Check:

   Min rooms = max overlaps tracked by min-heap = Sort intervals by start time, use a min-heap to track end times, count max simultaneous meetings. [OK]

Hint: Track earliest finishing meeting with min-heap to count rooms [OK]

Common Mistakes:

• Merging intervals instead of counting overlaps
• Using stack which doesn't track end times properly
• Ignoring sorting by start time