Median of Two Sorted Arrays at Bloomberg

Hard45.9% acceptance

This problem has 75.0% frequency at Bloomberg.

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 hints

Topics

Array Binary Search Divide and Conquer

Also asked at 46 companies

Accenture Adobe Amazon Apple Arcesium Autodesk Capgemini Cognizant DE Shaw Dropbox Flipkart GE Healthcare Goldman Sachs Google IBM Infosys LinkedIn Meta Microsoft NVIDIA+26 more

View Full Problem

Problem Description

Topics

Also asked at 46 companies

More Bloomberg Questions