You have given a list of intervals. Write a program to merge overlapping intervals.
Input: Given list of intervals: [[1, 3], [2, 6], [8, 10]] Output: List of intervals after merging: [[1, 6], [8, 10]]
This coding challenge was asked in Biju’s coding interview.
You can watch the video for a detailed explanation. Else, you can continue with this tutorial.
(Want to learn more coding challenges? Subscribe to the CSEstack YouTube channel.)
[1, 3] and
[2, 6] overlaps. So we can merge these two intervals. The resultant interval after merging is
[8, 10] does not overlap. So it will be as it is.
This coding challenge was asked in Biju’s interview for a software engineering job profile.
ias an index of the interval and
arras interval array)
pop_elementoverlaps with the
arr[i]in the stack.
Let’s write the code for this logic.
For coding practice, I would recommend you write your own code. Whether you write it in C/C++, Java, Python, or any other programming language, That’s fine. You can always refer to the code given below.
Intervals are represented in the form of a list. In this code, we are going to use various list methods to manipulate the intervals. Check the Python List tutorial.
Here, one of the major steps is to sort the intervals by their first value. In Python, we have the
sort() method by which we can sort the intervals by their first value. Python makes the job pretty easy. Isn’t it?
Let’s see the complete program.
# Helper function to check # if the two intervals overlaps def is_overlaping(a, b): if b > a and b < a: return True else: return False # merge the intervals def merge(arr): #sort the intervals by its first value arr.sort(key = lambda x: x) merged_list=  merged_list.append(arr) for i in range(1, len(arr)): pop_element = merged_list.pop() if is_overlaping(pop_element, arr[i]): new_element = pop_element, max(pop_element, arr[i]) merged_list.append(new_element) else: merged_list.append(pop_element) merged_list.append(arr[i]) return merged_list # test the code arr = [[1,3], [2,6], [8,10]] print(merge(arr))
[[1, 6], [8, 10]]
Merge Overlapping Intervals is one of the really interesting coding challenges. You can implement this program in any language of your choice like C/C++, Java, and Python. Let’s share your code in the comment section below.