New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Google
Coding Question
AI Insights
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
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Accepted
2.3k
/4.4k
Acceptance Rate
52.6%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
nums =
Output
Expected
