OCI电话面试

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. Ask for a very efficient solution

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

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

Facebook也考过这题。

注意:OCI的招聘流程简直是乱得一批啊,电话面试鸽了我3次,面试官一直说自己特别忙,一会儿再赶项目,一会儿在开会,最后经理出来面的。印度公司不值得!

1 Like

oracle 不是 hiring freeze 了吗

A和B是sort好的,可以用两指针的方法做,可以O(n)