Hi, I received a coding question in my phone screen on Friday.

Question 1 is: Given a binary tree and a target value, find two keys such that they sum to a target value and also such that the two keys dont lie on the same level.

Question2: Given an array which has m sorted sequences, sort it completely. Ofcourse , there should be a better way than applying some sort algo to do so.
ex: m=3, array={2,3,4,-1,0,7,8,9}.Dups allowed.
sort it.