• Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard
CSEstack

What do you want to Learn Today?

  • Programming
    • Tutorial- C/C++
    • Tutorial- Django
    • Tutorial- Git
    • Tutorial- HTML & CSS
    • Tutorial- Java
    • Tutorial- MySQL
    • Tutorial- Python
    • Competitive Coding Challenges
  • CSE Subject
    • (CD) Compiler Design
    • (CN) Computer Network
    • (COA) Computer Organization & Architecture
    • (DBMS) Database Management System
    • (DS) Data Structure
    • (OS) Operating System
    • (ToA) Theory of Automata
    • (WT) Web Technology
  • Interview Questions
    • Interview Questions- Company Wise
    • Interview Questions- Coding Round
    • Interview Questions- Python
    • Interview Questions- REST API
    • Interview Questions- Web Scraping
    • Interview Questions- HR Round
    • Aptitude Preparation Guide
  • GATE 2021
  • Linux
  • Trend
    • Full Stack Development
    • Artificial Intelligence (AI)
    • BigData
    • Cloud Computing
    • Machine Learning (ML)
  • Write for Us
    • Submit Article
    • Submit Source Code or Program
    • Share Your Interview Experience
  • Tools

[Solved] Merge Overlapping Intervals in Python, C/C++ and Java

Aniruddha Chaudhari/2844/0
CodePython
YouTube CSEstack

You have given a list of intervals. Write a program to merge overlapping intervals.

Example

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.)

Explanation

Here intervals [1, 3] and [2, 6] overlaps. So we can merge these two intervals. The resultant interval after merging is [1, 6].

Interval [8, 10] does not overlap. So it will be as it is.

This coding challenge was asked in the Biju’s interview for software engineering job profile.

Algorithm

  • Sort the intervals by their first value if it is not sorted.
  • Add the first interval in the stack.
  • Traverse over all the elements in the given interval array by skipping the first interval. (says i as an index of the interval and arr as interval array)
    • Pop the interval from the stack (says pop_element)
    • Check if the pop_element overlaps with the arr[i] interval.
      (Write the helper function for this. This function will take the two intervals as an input and returns True if they overlap. Otherwise, return False.)
    • If overlaps, merge these two intervals and add them to the stack. Else, add arr[i] in the stack.
  • Return output stack as merged intervals.

Let’s write the code for this logic.

For coding practice, I would recommend you to write your own code. Whether you write it in C/C++, Java, Python or any other programming languages, That’s fine. You can always refer the code given below.

Python Program

Prerequisite:

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.

Code:

# Helper function to check 
# if the two intervals overlaps
def is_overlaping(a, b):
  if b[0] > a[0] and b[0] < a[1]:
    return True
  else:
    return False


# merge the intervals
def merge(arr):
  #sort the intervals by its first value
  arr.sort(key = lambda x: x[0])

  merged_list= []
  merged_list.append(arr[0])
  for i in range(1, len(arr)):
    pop_element = merged_list.pop()
    if is_overlaping(pop_element, arr[i]):
      new_element = pop_element[0], max(pop_element[1], arr[i][1])
      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))

Output

[[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.

Python Interview Questions eBook

coding challenge
Aniruddha Chaudhari
I am complete Python Nut, love Linux and vim as an editor. I hold a Master of Computer Science from NIT Trichy. I dabble in C/C++, Java too. I keep sharing my coding knowledge and my own experience on CSEstack.org portal.

Your name can also be listed here. Got a tip? Submit it here to become an CSEstack author.

Leave a Reply Cancel reply

Why?

Why Competitive Programming Important?

Coding Challenges for Practice

  1. Count Common Factor
  2. Does it Divide
  3. Sum of Sub Arrays
  4. Pair of Desired Sum
  5. Remove Duplicate Char from String
  6. Sort String by Char Freq (Python)
  7. Sort String by Char Freq (Java)
  8. Split Array into Equal Sum Subarray
  9. Validate IP Address
  10. Validate PAN Card Number
  11. Sort Circular Rotated Array
  12. Min Arrow to Burst Bubbles
  13. HourGlass with Largest Sum
  14. Max Profit by Buying/Selling Stocks
  15. Hailstone Sequence
  16. Reverse String without affecting Special Characters
  17. Secure Conversation by Encry/Decry
  18. Special Elements in Matrix
  19. Next Greater No with Same set of Digits
  20. Smallest Subarray with Sum Greater than Given Number
  21. Group Anagrams
  22. Find Duplicates in Array in O(n)
  23. Find Two Unique Numbers from Array in O(n)
  24. Number Patterns & Finding Smallest Number
  25. Minimum Cost of Merging Files [Amazon]
  26. Minimum Distance for Truck to Deliver Order [Amazon]
  27. Minimum Coins Required
  28. Max Sum Subarray
  29. Merge Overlapping Intervals
  30. Longest Balanced Subarray
  31. Longest Path in a Weighted Tree
  32. Generate Balanced Parentheses
  33. PostOrder Traversal Without Recursion

© 2021 – CSEstack.org. All Rights Reserved.

  • Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard