Learn and practice the Merge Intervals and K-way Merge patterns to solve coding interview problems.

Educative-99 in Java: Accelerate Your Coding Interview Prep

Many information processing and decision-support problems require us to merge information coming from multiple sources to build up a global picture of a situation before making some business decisions. This module will help us understand and deploy two common coding patterns used to merge lists of structurally homogeneous data to solve hard problems that we encounter, for example, in scheduling, social media applications, and I/O algorithms.

Fusion

# Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

From the following interval lists, find their intersecting intervals.

First list = [[2, 6], [7, 9], [10, 13], [14, 19], [20, 24]]

Second list = [[1, 4], [6, 8], [15, 18]]

From the following interval lists, find their intersecting intervals.
First list = [[2, 6], [7, 9], [10, 13], [14, 19], [20, 24]]
Second list = [[1, 4], [6, 8], [15, 18]]

[[1, 5], [6, 10], [11, 14], [15, 18], [19, 20]]

[[1, 5], [6, 10], [11, 14], [15, 18], [19, 29]]

From the following interval lists, find their intersecting intervals.

First list = [[1, 29]]

Second list = [[1, 5], [6, 10], [11, 14], [15, 18], [19, 20]]

From the following interval lists, find their intersecting intervals.
First list = [[1, 29]]
Second list = [[1, 5], [6, 10], [11, 14], [15, 18], [19, 20]]

Interval List Intersections

Interval List Intersections

# Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

# Try it yourself

Implement your solution in the following coding playground.

import java.util.*;

class Solution {

    public static int[][] intervalsIntersection(int[][] intervalLista, int[][] intervalListb) {
        // Replace this placeholder return statement with your code
        return new int[][]{};
    }
}


# Quick Fix\nYou are Edward, a Senior Software Engineer who specializes in coding interview patterns, data structures and algorithms, and is great at debugging issues in code.\n\n- Edward, please keep in mind that you do not have to print the data of the placeholders. Also, do not mention anything about yourself.\n\nEdward, you are given the following data in the placeholders:\n- Function name: `intervalsIntersection`\n- Candidate's submitted solution code: USER_CODE\n- Error: ERROR_DESCRIPTION\n- Failed test case: FAILED_TEST_CASE\n- Coding language: `Java`\n\n- Edward, your task is to understand the type of error that is occurring in the coding language provided.\n- Once you've understood the error as per the error’s description, and why the test case failed, you will suggest how the candidate can improve their solution code to fix the error.\n- Edward, you will not give the corrected code, just a hint on what the error tells, and how to fix it.\n- Edward, please limit your response strictly to 100 words. No more words than the limit.

# Review Code\nEdward, your current task is to review the `intervalsIntersection` function(s) and the other function(s) invoked in it/them.\n\n-Take your time and review the candidate's solution code.\n- Do not review any extra/helper files or functions not invoked in the solution function `intervalsIntersection`.\n- Do not review the code of data structure objects instantiated like a binary tree, linked list, trie, union find, etc., in the solution functions. Just review the solution/algorithm function of the problem. \n- Also, if the solution code doesn’t use the coding pattern stated above, then please encourage the candidate to reattempt the problem using that pattern corectly.

# Review time complexity\n- Please provide a brief time complexity analysis of the function(s) `intervalsIntersection`. \n- While calculating time complexity, include the time complexity of built-in Java functions invoked by the code. \n- The answer should be to the point in approximately 60 words.

# Review space complexity\n- Please provide a brief space complexity analysis of the function(s) `intervalsIntersection`. \n- While calculating space complexity, include the space complexity of built-in Java functions invoked by the code. \n- Do not include the space used for the input parameters and the space used for just returning an output (not used as a scratch space). \n- The answer should be to the point in approximately 60 words.

TwoDArray

import ds_v1.DataStructure.DataStructure;
import java.util.*;
import java.io.IOException;
import com.fasterxml.jackson.databind.ObjectMapper;
public class TwoDArray extends DataStructure {

 // define class attributes
 int [][] arr={{}};
 private void generateError(String data) {
 System.err.println("TwoDArray is not parsable: " + data);
 System.exit(-1);
 }

 public TwoDArray() {
 // constructor
 }
 public TwoDArray(int[][] data) {
 arr = copy(data);
 }

 public String toString() {
 // override toString() for your data structure
 return Arrays.deepToString(arr);
 }

 // return value will be passed to user program
 @Override
 public TwoDArray construct(String new_value, Integer type_of_ds) {
 int[][] data={{}};
 try {
 ObjectMapper mapper = new ObjectMapper();
 data = mapper.readValue(new_value, int[][].class);
 
 } catch (IOException e) {
 e.printStackTrace();
 }
 return new TwoDArray(data);

 }

 // input param contains return value of user program
 @Override
 public String traverse(Object input, Integer type_of_ds) {
 // convert your data structure 'input' to a json string representing a test case output
 return input.toString();
 }
 public static int[][] copy(int[][] src) {
 if (src == null) {
 return null;
 }
 
 int[][] copy = new int[src.length][];
 for (int i = 0; i < src.length; i++) {
 copy[i] = Arrays.copyOf(src[i], src[i].length);
 }
 
 return copy;
 }

}

def evaluate_results(self) -> object:
 """
 self.__inputs is the list of inputs that are passed as input to function
 self.__actual_output is a list of outputs that is produced by the learner's code
 return : self.__edu__result object
 """
 def intervals_intersection(interval_list_a, interval_list_b):
 

 intersections = [] 
 i = j = 0

 while i < len(interval_list_a) and j < len(interval_list_b):
 start = max(interval_list_a[i][0], interval_list_b[j][0])
 end = min(interval_list_a[i][1], interval_list_b[j][1])

 if start <= end: 
 intersections.append([start, end]) 

 if interval_list_a[i][1] < interval_list_b[j][1]:
 i += 1
 else:
 j += 1

 return intersections






 # multiple outputs will be added at each index respectively for a single test_case
 expected_outputs = [] 
 # store the 1st expected output that should be displayed to the user 
 expected_outputs.append(sorted(intervals_intersection(self.__inputs[0] , self.__inputs[1])))

 if json.dumps(sorted(intervals_intersection(self.__inputs[0] , self.__inputs[1]))) == json.dumps(sorted(self.__actual_outputs[0])):
 self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
 else:
 self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

 return self.__edu_result

import java.util.*;
public class Main{
    public static TwoDArray sum (TwoDArray input_1, TwoDArray input_2) {
        TwoDArray res = new TwoDArray();
        res.arr = Solution.intervalsIntersection(input_1.arr, input_2.arr);
        return res;

    }
}

PrivateTestCases.yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1 : [[1, 4], [5, 6], [7, 8], [9, 15]]
    - 2 : [[2, 4], [5, 7], [9, 15]]
    output: 
    - 1 : [[2, 4], [5, 6], [7, 7], [9, 15]]

  - name: "testcase 2"
    inputs:
    - 1: [[1, 3], [4, 6], [8, 10], [11, 15]]
    - 2: [[2, 3], [10, 15]]
    output:
    - 1 : [[2, 3], [10, 10], [11, 15]]

  - name: "testcase 3"
    inputs:
    - 1 : [[1, 2], [4, 6], [7, 8], [9, 10]]
    - 2 : [[3, 6], [7, 8], [9, 10]]
    output: 
    - 1 : [[4, 6], [7, 8], [9, 10]]

  - name: "testcase 4"
    inputs:
    - 1: [[1, 3], [5, 6], [7, 8], [9, 10], [12, 15]]
    - 2: [[2, 4], [7, 10]]
    output:
    - 1 : [[2, 3], [7, 8], [9, 10]]

  - name: "testcase 5"
    inputs:
    - 1: [[1, 2]]
    - 2: [[1, 2]]
    output:
    - 1 : [[1, 2]]

def sum(input_1, input_2):
    return input_1+input_2

def validate_inputs(self) -> None:
 """
 self.__inputs is the list of inputs that are passed as input to function
 store the result using the self.store_result(error_msg, status)
 return : void
 """
 # inputs can be accessed using self.__inputs starting from 0 to len(self.__inputs) - 1

 def is_valid_2d_array(arr):
 if not isinstance(arr,list) or not all(isinstance(row, list) for row in arr):
 return False # Not a valid 2D array if it's empty or contains non-list elements
 
 for row in arr:
 if any(elem is None or isinstance(elem, bool) for elem in row):
 return False # Not a valid 2D array if any element in a row is None
 if not all(isinstance(elem, int) for elem in row):
 return False 
 return True

 
 
 if not is_valid_2d_array(self.__inputs[0]):
 self.store_result ("First input is of invalid type", ValidationFunction.FAIL)
 
 elif not is_valid_2d_array(self.__inputs[1]):
 self.store_result ("Second input is of invalid type", ValidationFunction.FAIL)



 
 elif not isinstance(self.__inputs[0],list):
 self.store_result ("First argument should be a list", ValidationFunction.FAIL)
 elif not isinstance(self.__inputs[1],list):
 self.store_result ("Second argument should be a list", ValidationFunction.FAIL)

 elif not all([len(x)==2 for x in self.__inputs[0]]):

 self.store_result("Length of each interval should be exactly 2", ValidationFunction.FAIL)

 elif not all([len(x)==2 for x in self.__inputs[1]]):

 self.store_result("Length of each interval should be exactly 2", ValidationFunction.FAIL)

 elif not (0 <= len(self.__inputs[0]) <= 10**3):
 self.store_result ("Length of List a should be between 0 and 10^3", ValidationFunction.FAIL)

 elif not (0 <= len(self.__inputs[1]) <= 10**3):
 self.store_result ("Length of List b should be between 0 and 10^3", ValidationFunction.FAIL)

 elif not all(isinstance(x,list) for x in self.__inputs[0]):
 self.store_result ("List a should contain only lists", ValidationFunction.FAIL)

 elif not all(isinstance(x,list) for x in self.__inputs[1]):
 self.store_result ("List b should contain only lists", ValidationFunction.FAIL)

 elif not all(isinstance(x,int) and isinstance(y,int) for x,y in self.__inputs[0]):
 self.store_result ("Each interval in List a should contain only integers", ValidationFunction.FAIL)

 elif not all(isinstance(x,int) and isinstance(y,int) for x,y in self.__inputs[1]):
 self.store_result ("Each interval in List b should contain only integers", ValidationFunction.FAIL)
 
 
 elif not all([(0 <= start < end) for start,end in self.__inputs[0]]):
 self.store_result ("Start time in List a should be greater than or equal to 0 and less than its end time", ValidationFunction.FAIL)

 
 elif not all([(0 <= start < end) for start,end in self.__inputs[1]]):
 self.store_result ("Start time in List b should be greater than or equal to 0 and less than its end time", ValidationFunction.FAIL)
 
 
 

 elif not all([end<=10**9 for start,end in self.__inputs[0]]):
 self.store_result ("End time in List a should be less than or equal to 10^9", ValidationFunction.FAIL)

 elif not all([end<=10**9 for start,end in self.__inputs[1]]):
 self.store_result ("End time in List b should be less than or equal to 10^9", ValidationFunction.FAIL)
 
 

 elif not all([self.__inputs[0][y+1][0]>self.__inputs[0][y][1] for y in range(len(self.__inputs[0])-1)]):
 self.store_result ("Intervals in List a should be non-overlapping", ValidationFunction.FAIL)

 elif not all([self.__inputs[1][y+1][0]>self.__inputs[1][y][1] for y in range(len(self.__inputs[1])-1)]):
 self.store_result ("Intervals in List b should be non-overlapping", ValidationFunction.FAIL)




 
 else:
 self.store_result("", ValidationFunction.PASS)

Try to solve the Interval List Intersections problem.

Merge Intervals

K-way Merge

Conclusion

Interval List Intersections

Statement

Examples

Understand the problem

Figure it out!

Try it yourself