Meta | E4 | Phone Screen

Round 1

Questions:

1. 1008. Construct Binary Search Tree from Preorder Traversal

2. Variant of Merge Intervals but instead: Given A and B two interval lists, A has no overlap inside A, and B has no overlap inside B. Write the function to merge two interval lists, output the result with no overlap.

   For example,

   A: [2,6], [10,14], [16,18]
   B: [1,5], [8,10], [11,20]

   output [1,6], [8, 20]