Practice Airbnb Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Find the median of a large, unsorted integer array.
Achieve amortized O(N) time complexity without performing a full sort.
Locate the middle value by systematically narrowing a candidate value range.

What This Tests

Applying binary search to a numeric domain instead of array indices
Optimizing selection problems beyond naive sorting approaches
Correctly handling odd versus even length array edge cases
Performing linear-time verification within iterative reduction steps

Common Patterns

Binary Search on Answer

Accepted

2.7k/5.4k

Acceptance Rate50.9%

Test Cases

Input

nums =

Output

Expected