title: I have 2 sorted arrays of integers, how do I find the kth biggest item in O(logn) time?
body: <p>I was asked this question in an interview. I was able to do it in O(n) time obviously, but I fail to think about a way to solve in in O(logn). It sounds like using some divide-and-conquer algorithms but I'm not sure.</p>