← Amazon questions

Median of two sorted arrays without extra space

Filed under Amazon · Also reported at Microsoft

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays without using extra space, achieving an O(log(min(m, n))) time complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.