Intersection of two sorted arrays
Given two arrays a and b that are each sorted in ascending order (possibly with duplicates), return their intersection as a sorted list that includes each common value as many times as it appears in both (i.e., min multiplicity). Either array may be empty.
Implement
sorted_intersection(a: list[int], b: list[int]) → list[int]Examples
in
[[1,2,2,3],[2,2,4]]out[2,2]What 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.
0:00 of about 15 min
solution.py
InputExpectedGot
[[1,2,2,3],[2,2,4]][2,2]not run yetsample