Data Structures and Algorithms: Insert Interval 🚀

Welcome to this comprehensive guide on the Insert Interval concept, designed for both beginners and intermediate learners! In this lesson, we'll delve into the world of data structures and algorithms, focusing on the Insert Interval problem. By the end of this tutorial, you'll have a solid understanding of how to solve this problem and be ready to apply it in real-world scenarios. 🎯

What is Insert Interval? 🤔

Imagine you have an array of time intervals, where each interval is represented as a pair of start and end times. Your task is to insert a new interval into this array, ensuring that the new interval does not overlap with any existing ones. This is known as the Insert Interval problem. 📝

Understanding Intervals 💡

An interval is a pair of numbers representing a range of time. For instance, [start, end] represents a time range from start to end.

Here's an example of an array of intervals:

python

intervals = [
    [1, 3],
    [6, 9],
    [2, 5]
]

In this example, the first interval starts at 1 and ends at 3, the second interval starts at 6 and ends at 9, and the third interval starts at 2 and ends at 5.

Solving the Insert Interval Problem 💻

To solve the Insert Interval problem, we'll write an algorithm that checks if the new interval overlaps with any existing ones, and if not, inserts it at the appropriate position in the array.

Let's consider an example where we want to insert the interval [4, 8] into our existing intervals array.

python

intervals = [
    [1, 3],
    [6, 9],
    [2, 5]
]

new_interval = [4, 8]

Our algorithm will first check if the new interval overlaps with any existing ones. In this case, since [4, 8] does not overlap with any existing intervals, we can simply append it to the end of the array.

Here's a step-by-step breakdown of the algorithm:

Check if the new interval is empty: If the new interval is empty, we return the original array as it is.
Check if the new interval overlaps with any existing ones: We iterate through the array of existing intervals and compare the start and end times of the new interval with each existing interval. If the new interval overlaps with any existing one, we'll adjust the start and end times of the overlapping interval(s) and continue our comparison.
Insert the new interval: If the new interval does not overlap with any existing ones, we insert it at the appropriate position in the array. If the array is empty, we simply append the new interval.

Writing the Code ⚙️

Now that we understand the Insert Interval problem and the algorithm to solve it, let's write the code in Python.

python

def insert_interval(intervals, new_interval):
    if not new_interval:
        return intervals

    # Check if the new interval overlaps with any existing ones
    for i in range(len(intervals)):
        current_interval = intervals[i]
        if (
            new_interval[0] <= current_interval[1] and
            new_interval[1] >= current_interval[0]
        ):
            # Adjust the start and end times of the overlapping interval(s)
            intervals[i] = [min(new_interval[0], current_interval[0]), max(new_interval[1], current_interval[1])]
            break

    # Insert the new interval at the appropriate position
    if not intervals:
        intervals.append(new_interval)
    else:
        intervals.insert(
            len(intervals), new_interval
        )

    return intervals

Testing the Code ✅

Let's test our insert_interval function with the example we discussed earlier.

python

intervals = [
    [1, 3],
    [6, 9],
    [2, 5]
]

new_interval = [4, 8]

result = insert_interval(intervals, new_interval)
print(result)

When you run this code, you should see the following output:

python

[[1, 3], [2, 5], [4, 8], [6, 9]]

Quiz Time 🧪

Now that you've learned about the Insert Interval problem and the algorithm to solve it, let's test your understanding with a quiz.

That's it for today! You've now learned about the Insert Interval problem and have written code to solve it. Keep practicing and expanding your knowledge of data structures and algorithms to become a proficient programmer! 🚀