Contained Interval - Amazon Top Interview Questions


Problem Statement :


You are given a two-dimensional list of integers intervals where each element is an inclusive interval [start, end]. Return whether there's an interval which contains another interval.

Constraints

n ≤ 100,000 where n is the length of intervals.

Example 1

Input

intervals = [
    [1, 3],
    [4, 10],
    [4, 8],
    [9, 9]
]


Output
True


Explanation
[4, 10] contains [4, 8].

Example 2

Input
intervals = [
    [1, 3],
    [4, 10],
    [7, 12]
]


Output
False


Explanation
No interval completely contains another.


Solution :



title-img 




                        Solution in C++ :

bool solve(vector<vector<int>>& intervals) {
    sort(intervals.begin(), intervals.end());
    for (int i = 1; i < intervals.size(); i++) {
        if (intervals[i][0] == intervals[i - 1][0]) {
            return true;
        } else {
            if (intervals[i][1] <= intervals[i - 1][1]) {
                return true;
            }
        }
    }
    return false;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public boolean solve(int[][] intervals) {
        Arrays.sort(intervals, new java.util.Comparator<int[]>() {
            public int compare(int[] a, int[] b) {
                return Integer.compare(a[0], b[0]);
            }
        });
        for (int i = 1; i < intervals.length; i++) {
            if (intervals[i - 1][0] == intervals[i][0] || intervals[i - 1][1] >= intervals[i][1])
                return true;
        }
        return false;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, intervals):

        if not intervals:
            return False
        intervals.sort(key=lambda x: x[1])
        pa, pb = intervals[0]
        for i in range(1, len(intervals)):
            a, b = intervals[i]
            if (pa >= a and pb <= b) or (pa <= a and pb >= b):
                return True
            pa, pb = a, b
        return False


View More Similar Problems

Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →

Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →

Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →

Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →

Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →