Double binary search with O(log m + log n) time while offering verbal answer for O(log (m * n)) solution, however interviewer gave a different time complexity which I later verified my original analysis was the correct one.