Why Intervals Are a Common Problem Pattern in DSA Go - Why This Pattern

Mental Model

Intervals represent ranges of values that often overlap or need merging, making them a common pattern to solve problems about scheduling, coverage, or grouping.

Analogy: Imagine booking meeting rooms where each meeting has a start and end time; you need to see which meetings overlap or fit together without conflict.

Time line:
|----|----|----|----|----|----|----|----|----|
Meetings:
[1---3]   [2----5]      [6---8]
Overlap:  [1---5] merged from first two

Dry Run Walkthrough

Input: Intervals: [1,3], [2,5], [6,8]

Goal: Show how overlapping intervals merge to form a combined range

Step 1: Sort intervals by start time

[1,3] -> [2,5] -> [6,8]

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

Step 2: Compare first interval [1,3] with second [2,5], they overlap

[1,3] and [2,5] overlap

Why: Overlap means we can merge these intervals into one

Step 3: Merge [1,3] and [2,5] into [1,5]

[1,5] -> [6,8]

Why: Merged interval covers both original intervals without gaps

Step 4: Compare merged [1,5] with [6,8], no overlap

[1,5] -> [6,8]

Why: No overlap means intervals stay separate

Result:

[1,5] -> [6,8]

Annotated Code

DSA Go

package main

import (
	"fmt"
	"sort"
)

type Interval struct {
	start int
	end   int
}

func mergeIntervals(intervals []Interval) []Interval {
	if len(intervals) == 0 {
		return intervals
	}

	sort.Slice(intervals, func(i, j int) bool {
		return intervals[i].start < intervals[j].start
	})

	merged := []Interval{intervals[0]}

	for i := 1; i < len(intervals); i++ {
		last := &merged[len(merged)-1]
		if intervals[i].start <= last.end {
			if intervals[i].end > last.end {
				last.end = intervals[i].end
			}
		} else {
			merged = append(merged, intervals[i])
		}
	}

	return merged
}

func main() {
	intervals := []Interval{{1, 3}, {2, 5}, {6, 8}}
	merged := mergeIntervals(intervals)
	for _, iv := range merged {
		fmt.Printf("[%d,%d] ", iv.start, iv.end)
	}
	fmt.Println()
}

sort.Slice(intervals, func(i, j int) bool { return intervals[i].start < intervals[j].start })

sort intervals by start time to process in order

merged := []Interval{intervals[0]}

initialize merged list with first interval

for i := 1; i < len(intervals); i++ {

iterate over remaining intervals to check overlap

if intervals[i].start <= last.end {

check if current interval overlaps with last merged

if intervals[i].end > last.end { last.end = intervals[i].end }

extend last merged interval if current ends later

else { merged = append(merged, intervals[i]) }

no overlap, add current interval as new merged interval

Output

[1,5] [6,8] 

Complexity Analysis

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

Space: O(n) because in worst case no intervals overlap and merged list stores all intervals

vs Alternative: Naive approach checks every pair for overlap O(n^2), sorting + one pass merging is more efficient

Edge Cases

empty intervals list

returns empty list immediately

DSA Go

if len(intervals) == 0 { return intervals }

intervals with no overlaps

all intervals remain separate in merged list

DSA Go

else { merged = append(merged, intervals[i]) }

intervals fully contained inside another

merged interval extends to cover largest end only

DSA Go

if intervals[i].end > last.end { last.end = intervals[i].end }

When to Use This Pattern

When you see problems about ranges, schedules, or grouping overlapping segments, think of intervals because they help organize and merge overlapping data efficiently.

Common Mistakes

Mistake: Not sorting intervals before merging
Fix: Always sort intervals by start time first to ensure correct merging order

Mistake: Not updating the end of merged interval when current interval extends it
Fix: Check if current interval's end is greater and update merged interval's end accordingly

Summary

It merges overlapping intervals into combined ranges.

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

Sorting intervals by start time first makes merging simple and linear.

Practice

1. Why are intervals commonly used in problems involving scheduling or time management?

easy

A. Because intervals are only used for sorting numbers

B. Because intervals represent ranges of time or values that can overlap or be merged

C. Because intervals always represent single points in time

D. Because intervals cannot overlap in any problem

Solution

1. Step 1: Understand what intervals represent

   Intervals represent a start and end range, often used to show time periods or value ranges.

2. Step 2: Recognize why intervals are useful in scheduling

   They help model overlapping events or tasks that need merging or conflict checking.

3. Final Answer:

   Because intervals represent ranges of time or values that can overlap or be merged -> Option B

4. Quick Check:

   Intervals = ranges that can overlap [OK]

Hint: Intervals model ranges that can overlap or merge [OK]

Common Mistakes:

• Thinking intervals are single points
• Assuming intervals never overlap
• Confusing intervals with unrelated data types

2. Which of the following is the correct Go syntax to declare a struct representing an interval with start and end integers?

easy

A. type Interval struct { start int; end int }

B. struct Interval { int start; int end }

C. Interval := struct { start, end int }

D. type Interval = (start int, end int)

Solution

1. Step 1: Recall Go struct declaration syntax

   In Go, structs are declared with 'type Name struct { fields }' and fields have type after name.

2. Step 2: Check each option

   type Interval struct { start int; end int } matches Go syntax exactly. struct Interval { int start; int end } uses C-style syntax. Interval := struct { start, end int } is invalid assignment. type Interval = (start int, end int) uses tuple-like syntax not in Go.

3. Final Answer:

   type Interval struct { start int; end int } -> Option A

4. Quick Check:

   Go struct syntax = type Name struct { fields } [OK]

Hint: Go structs use 'type Name struct { fields }' syntax [OK]

Common Mistakes:

• Using C or other language struct syntax
• Trying to assign struct to variable directly
• Using tuple or parentheses syntax

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

package main
import "fmt"
type Interval struct { start, end int }
func mergeIntervals(intervals []Interval) []Interval {
    if len(intervals) == 0 { return intervals }
    result := []Interval{}
    current := intervals[0]
    for i := 1; i < len(intervals); i++ {
        if intervals[i].start <= current.end {
            if intervals[i].end > current.end {
                current.end = intervals[i].end
            }
        } else {
            result = append(result, current)
            current = intervals[i]
        }
    }
    result = append(result, current)
    return result
}
func main() {
    intervals := []Interval{{1,3}, {2,6}, {8,10}, {15,18}}
    merged := mergeIntervals(intervals)
    for _, iv := range merged {
        fmt.Printf("%d-%d ", iv.start, iv.end)
    }
}

medium

A. 1-6 8-10 15-18

B. 1-3 2-6 8-10 15-18

C. 1-6 2-6 8-10 15-18

D. 1-3 8-10 15-18

Solution

1. Step 1: Understand merging logic

   The code merges intervals if current interval start is <= previous end, extending end if needed.

2. Step 2: Trace intervals one by one

   Start with {1,3}, next {2,6} overlaps, merge to {1,6}. Next {8,10} no overlap, add {1,6} to result, current = {8,10}. Next {15,18} no overlap, add {8,10}, current = {15,18}. Finally add {15,18}.

3. Final Answer:

   1-6 8-10 15-18 -> Option A

4. Quick Check:

   Merged intervals = 1-6 8-10 15-18 [OK]

Hint: Merge intervals by extending end if overlapping [OK]

Common Mistakes:

• Not updating current interval end correctly
• Appending intervals too early or late
• Confusing overlap condition

4. The following Go function is intended to check if two intervals overlap. What is the bug?

func isOverlap(a, b Interval) bool {
    return a.start < b.end && b.start < a.end
}

medium

A. There is no bug; the function correctly checks overlap

B. The function should use '>' instead of '<' for comparisons

C. The function should compare start with start and end with end only

D. The function incorrectly uses '<' instead of '<=' causing missed overlaps

Solution

1. Step 1: Understand overlap condition

   Two intervals overlap if one starts before the other ends, including touching edges.

2. Step 2: Check use of '<' vs '<='

   Using '<' misses cases where intervals just touch (e.g., end == start). Using '<=' includes touching as overlap.

3. Final Answer:

   The function incorrectly uses '<' instead of '<=' causing missed overlaps -> Option D

4. Quick Check:

   Overlap check needs <= to include touching intervals [OK]

Hint: Use <= to include touching intervals as overlapping [OK]

Common Mistakes:

• Using strict < misses edge overlaps
• Confusing start and end comparisons
• Assuming no overlap if edges touch

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 and count how many end before next start

B. Merge all intervals and count how many merged intervals remain

C. Sort intervals by start time, use a min-heap to track earliest end time, allocate rooms accordingly

D. Count intervals and divide by two to estimate rooms

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 finishing meeting

   Min-heap stores end times of ongoing meetings; if next meeting starts after earliest end, reuse room; else allocate new room.

3. Step 3: Count rooms allocated

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

4. Final Answer:

   Sort intervals by start time, use a min-heap to track earliest end time, allocate rooms accordingly -> Option C

5. Quick Check:

   Min rooms = max concurrent meetings tracked by min-heap [OK]

Hint: Use min-heap on end times after sorting by start [OK]

Common Mistakes:

• Merging intervals loses overlap info
• Dividing count by two is incorrect
• Sorting by end time alone misses overlaps