Interval Overlaps - Amazon Top Interview Questions
Problem Statement :
You are given a list of closed intervals l0 and another list of intervals l1. Individually, each list is non-overlapping and are sorted in ascending order.
Return the overlap of the two intervals sorted in ascending order.
Constraints
n ≤ 100,000 where n is the length of l0
m ≤ 100,000 where m is the length of l1
Example 1
Input
l0 = [
[1, 3],
[5, 6],
[7, 9]
]
l1 = [
[1, 4],
[5, 7]
]
Output
[
[1, 3],
[5, 6],
[7, 7]
]
Example 2
Input
l0 = [
[1, 3],
[5, 6],
[7, 9]
]
l1 = [
[100, 200]
]
Output
[]
Solution :
Solution in C++ :
vector<vector<int>> solve(vector<vector<int>>& l0, vector<vector<int>>& l1) {
vector<vector<int>> ans;
int s0 = l0.size(), s1 = l1.size(), i = 0, j = 0;
while (i < s0 && j < s1) {
if ((l0[i][0] > l1[j][1]))
j++;
else if (l0[i][1] < l1[j][0])
i++;
else {
ans.push_back({max(l0[i][0], l1[j][0]), min(l0[i][1], l1[j][1])});
if (l0[i][1] > l1[j][1])
j++;
else if (l0[i][1] < l1[j][1])
i++;
else
i++, j++;
}
}
return ans;
}
Solution in Python :
class Solution:
def solve(self, l0, l1):
m, n = len(l0), len(l1)
l = r = 0
res = []
while l < m and r < n:
s0, e0, s1, e1 = *l0[l], *l1[r]
if s0 > e1:
r += 1
elif e0 < s1:
l += 1
else:
res.append([max(s0, s1), min(e0, e1)])
if e0 > e1:
r += 1
else:
l += 1
return res
View More Similar Problems
Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →Components in a graph
There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu
View Solution →Kundu and Tree
Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that
View Solution →Super Maximum Cost Queries
Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and
View Solution →Contacts
We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co
View Solution →