You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Median of Two Sorted Arrays: Logarithmic PartitionHard
SUPER HARD PROBLEM OF THE DAY+150 XP • FAANG OA TIER
High-difficulty challenge matching authentic Google, Amazon & Uber L5 online assessment conditions.
HardBinary Search•Acceptance: 39.8%
Median of Two Sorted Arrays: Logarithmic Partition
Targeted in FAANG & Tech OA:GoogleMicrosoftAmazon
Real-World Engineering Context
Used in real-time distributed telemetry streams (Kafka / ClickHouse) at Uber and Amazon to compute median latency SLAs across partitioned edge logs without merging them.
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 must be `O(log (m+n))`.
Sample Test Cases
Input: [[1,3],[2]]
Expected: 2
Input: [[1,2],[3,4]]
Expected: 2.5
Input: [[1,2],[5,6,7]]
Expected: 5
Constraints
- nums1.length == m
- nums2.length == n
- 0 <= m <= 1000
- 0 <= n <= 1000
- 1 <= m + n <= 2000
- -10^6 <= nums1[i], nums2[i] <= 10^6
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.