Leetcode, Interval, Interview Questions, Google, Meta.
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. A naive method can combine the two list, and sort and apply merge interval in the leetcode, but is not efficient enough. For example, A: [1,5], [10,14],