Why Intervals Are a Common Problem Pattern in DSA Typescript - Performance Analysis

Time Complexity: Why Intervals Are a Common Problem Pattern

O(n²)

Understanding Time Complexity

Intervals problems often involve checking or merging ranges, which requires comparing many pairs.

We want to understand how the time needed grows as the number of intervals increases.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

function canAttendMeetings(intervals: number[][]): boolean {
  for (let i = 0; i < intervals.length; i++) {
    for (let j = i + 1; j < intervals.length; j++) {
      if (intervals[i][0] < intervals[j][1] && intervals[j][0] < intervals[i][1]) {
        return false;
      }
    }
  }
  return true;
}
    

This code checks if any intervals overlap by comparing each pair.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Nested loops comparing pairs of intervals.
• How many times: Outer loop runs n times; inner loop runs up to n-1 times, so roughly n x n = n² times.

How Execution Grows With Input

As the number of intervals grows, the number of comparisons grows much faster.

Input Size (n)	Approx. Operations
10	About 100 comparisons
100	About 10,000 comparisons
1000	About 1,000,000 comparisons

Pattern observation: Doubling the intervals roughly quadruples the work, showing a square growth.

Final Time Complexity

Time Complexity: O(n²)

This means the time needed grows quickly as the number of intervals increases, because every interval is compared with many others.

Common Mistake

[X] Wrong: "Checking intervals is always fast because we just look at each interval once."

[OK] Correct: Many interval problems require comparing pairs, which means the work grows much faster than just looking once.

Interview Connect

Understanding how interval problems scale helps you explain your approach clearly and choose efficient methods during interviews.

Self-Check

"What if we sort the intervals first and then check only adjacent pairs? How would the time complexity change?"

Practice

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

easy

A. Because they help solve scheduling and merging tasks efficiently

B. Because they only involve sorting numbers

C. Because they require complex graph traversal

D. Because they always use recursion

Solution

1. Step 1: Understand the nature of interval problems

   Interval problems often involve ranges of values, like time slots or numeric ranges, which are common in real-world tasks such as scheduling.

2. Step 2: Identify why intervals are useful

   Intervals allow efficient merging and checking overlaps, which are key in many applications like calendar events or resource allocation.

3. Final Answer:

   Because they help solve scheduling and merging tasks efficiently -> Option A

4. Quick Check:

   Intervals = scheduling and merging [OK]

Hint: Think about real-life tasks like booking or meetings [OK]

Common Mistakes:

• Assuming intervals only involve sorting
• Confusing intervals with graph problems
• Thinking recursion is always needed

2. Which TypeScript syntax correctly declares an interval as a tuple of two numbers?

easy

A. let interval: tuple = [5, 10];

B. let interval = (5, 10);

C. let interval: number[] = (5, 10);

D. let interval: [number, number] = [5, 10];

Solution

1. Step 1: Recall TypeScript tuple syntax

   Tuples in TypeScript are declared with square brackets and types inside, like [number, number].

2. Step 2: Check each option

   let interval: [number, number] = [5, 10]; correctly uses tuple syntax. let interval = (5, 10); uses parentheses which is invalid. let interval: number[] = (5, 10); uses array type but assigns parentheses. let interval: tuple = [5, 10]; uses 'tuple' which is not a TypeScript type.

3. Final Answer:

   let interval: [number, number] = [5, 10]; -> Option D

4. Quick Check:

   Tuple syntax = [number, number] [OK]

Hint: Tuples use square brackets with types inside [OK]

Common Mistakes:

• Using parentheses instead of square brackets
• Using 'tuple' as a type keyword
• Confusing arrays with tuples

3. What is the output of this TypeScript code that merges overlapping intervals?

function mergeIntervals(intervals: [number, number][]): [number, number][] {
  intervals.sort((a, b) => a[0] - b[0]);
  const merged: [number, number][] = [];
  for (const interval of intervals) {
    if (!merged.length || merged[merged.length - 1][1] < interval[0]) {
      merged.push(interval);
    } else {
      merged[merged.length - 1][1] = Math.max(merged[merged.length - 1][1], interval[1]);
    }
  }
  return merged;
}

console.log(mergeIntervals([[1,3],[2,6],[8,10],[15,18]]));

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: Sort intervals by start time

   The intervals become [[1,3],[2,6],[8,10],[15,18]].

2. Step 2: Merge overlapping intervals

   First interval [1,3] is added. Next [2,6] overlaps with [1,3], so merge to [1,6]. Then [8,10] and [15,18] do not overlap, so added as is.

3. Final Answer:

   [[1,6],[8,10],[15,18]] -> Option A

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
• Overwriting intervals incorrectly
• Missing to merge overlapping intervals

4. Find the error in this TypeScript function that checks if two intervals overlap:

function isOverlap(a: [number, number], b: [number, number]): boolean {
  return a[1] > b[0] && b[1] > a[0];
}

medium

A. The function should return a number, not boolean

B. The intervals should be arrays of strings, not numbers

C. The comparison should use >= instead of > to include touching intervals

D. The function is correct as is

Solution

1. Step 1: Understand interval overlap condition

   Two intervals overlap if they share any point, including touching at edges.

2. Step 2: Check the comparison operators

   Using > excludes intervals that just touch (like [1,2] and [2,3]). Using >= includes touching intervals as overlapping.

3. Final Answer:

   The comparison should use >= instead of > to include touching intervals -> Option C

4. Quick Check:

   Use >= for touching intervals overlap [OK]

Hint: Use >= to count touching intervals as overlapping [OK]

Common Mistakes:

• Using > excludes touching intervals
• Returning wrong data type
• Wrong interval data types

5. Given a list of intervals representing booked meeting times, how would you find the minimum number of meeting rooms required?
Choose the best approach.

hard

A. Count intervals and divide by two

B. Sort intervals by start time, use a min-heap to track end times, count rooms needed

C. Use recursion to check all combinations of intervals

D. Sort intervals by end time, merge all intervals into one

Solution

1. Step 1: Understand the problem of meeting rooms

   We need to find how many meetings overlap at the same time to know rooms needed.

2. Step 2: Use sorting and a min-heap

   Sort intervals by start time. Use a min-heap to track earliest ending meeting. If a meeting starts after the earliest ends, reuse room; else add a new room.

3. Step 3: Count the maximum size of the heap

   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 end times, count rooms needed -> Option B

5. Quick Check:

   Min rooms = max overlapping intervals [OK]

Hint: Track earliest end times with min-heap to count rooms [OK]

Common Mistakes:

• Merging intervals loses overlap info
• Using recursion causes inefficiency
• Simple division ignores overlaps