Median of Two Sorted Arrays

hard
Unit 25 · BFS II0/0 to milestone

Given two sorted lists a and b, find the median of their combined elements in O(log(min(m, n))) time, without merging them.

Pro problem

Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.

Start 7-day free trial
solution.py · Python 3.13
Run your code to see results. ⌘↵ to run · ⌘⇧↵ to submit
Median of Two Sorted Arrays · TechGradify