All challenges
Algorithm challenge · DSA
Median of Two Sorted Arrays
Difficulty
hard
Time
~45m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#binary-search#arrays
Mission file // read carefullyhard
Given two sorted ascending arrays a and b, return the median of the combined set as a floating-point number.
Example
a = [1,3], b = [2] => 2.0
a = [1,2], b = [3,4] => 2.5
Build with
findMedianSortedArrays(a: int[], b: int[]) → doublePythonJavaScriptTypeScriptGoJavaC++Rust
5 tests · 2 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.