File: root - text - article - 2019 - 11 - merge-overlapping-intervals.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 233 Views, 17214 Search Bots | 76 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 233 Views, 17214 Search Bots | 76 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Microsoft:
You are given an array of intervals - that is, an array of tuples (start, end). The array may not be sorted, and could contain overlapping intervals. Return another array where the overlapping intervals are merged.
For example:
[(1, 3), (5, 8), (4, 10), (20, 25)]
This input should return [(1, 3), (4, 10), (20, 25)] since (5, 8) and (4, 10) can be merged into (4, 10).
Here's a starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 233 Views, 17214 Search Bots | 76 Words You are given an array of intervals - that is, an array of tuples (start, end). The array may not be sorted, and could contain overlapping intervals. Return another array where the overlapping intervals are merged.
For example:
[(1, 3), (5, 8), (4, 10), (20, 25)]
This input should return [(1, 3), (4, 10), (20, 25)] since (5, 8) and (4, 10) can be merged into (4, 10).
Here's a starting point:
def merge(intervals):
# Fill this in.
print merge([(1, 3), (5, 8), (4, 10), (20, 25)])
# [(1, 3), (4, 10), (20, 25)]
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- [Daily Problem] Move Zeros
- Daily Interview Problem: Reverse Words in a String
- Daily Interview Problem: Largest Product of 3 Elements I
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- A trick for getting good at coding interviews FASTER
- Design Tic-Tac-Toe
- Binary Tree Level with Minimum Sum
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Validate Binary Search Tree
- Daily Interview Problem: Find the k-th Largest Element in a List
©2006~2024 SteakOverCooked - 0.01391 Seconds(s) - 1338.016 KB/s - 33 Online
Memory: 493.59 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !