Let A and B be two sorted arrays. The intent is to find the kth smallest number in the union of the two lists.
Sounds Simple, but the catch is to get it done with a better time complexity than O(size(A) + size(B)).
I now have the solution which works with O(log(size(A) + size(B)), but i gave a crappy solution to my friend who gave me this puzzle. I used the intuitive, 2 pointer solution. Dont fall for it.