Median of Two Sorted Arrays is one of the most famous Hard problems in the interview canon, and its reputation is earned by a single, brutal constraint: the required time complexity is O(log(m + n)). Without that constraint, the problem is trivial — merge the two arrays and grab the middle. With it, you're forced into a binary search, except there's no obvious single sorted array to binary-search over.

Learn how to solve the "Search in a Rotated Sorted Array" coding problem to prepare for your next technical interview!