Code Room
CodingHard
Question
Given two sorted ascending arrays a and b, return the median of the combined sorted array as a float. If the combined length is even, return the average of the two middle elements. Aim for O(log(min(len(a), len(b)))). Constraints: 0 <= len(a), len(b) <= 1000, total length >= 1, -10^6 <= values <= 10^6.
Implement
median_two_sorted(a: list[int], b: list[int]) → floatExamples
in
[[1,3],[2]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.