Coding

Find the median of two sorted arrays.

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Input: nums1 = [1, 2], nums2 = [3, 4]

Output: 2.5

Explanation: The merged array is [1, 2, 3, 4]. The median is the average of the two middle elements: (2 + 3) / 2 = 2.5.

Was asked at

Practice this question with AI

First session is free - no credit card required.

Go Premium

More interviews, more skills, more success.

Practice More Questions

1 answer published. Last candidate submission on May 27 2026, 12:16am PDT. Interview question asked to Software Engineers interviewing at Airbnb, Benchling, Blind and other companies. Original question asked: Find the median of two sorted arrays.. Question last reported by a candidate interviewing at Intel for a Software Engineer interview on Jul 20 2026, 12:02am PDT.