Median of Two Sorted Arrays at Goldman Sachs
Hard45.9% acceptance
This problem has 75.0% frequency at Goldman Sachs.
Problem Description
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))`.
Read full problem and hintsTopics
Also asked at 46 companies
More Goldman Sachs Questions
Trapping Rain WaterHardContainer With Most WaterMediumSearch in Rotated Sorted ArrayMediumMinimum Path SumMediumFind Minimum in Rotated Sorted ArrayMedium
View all Goldman Sachs questions