Code RoomIntersection of arrays
EasyPrep Room Coding #1618

Intersection of arrays

CodingAlgorithms & data structuresEntry–Mid~15 min

Return the sorted list of distinct values that appear in both integer arrays.

Implement
intersect_sorted(a: list[int], b: list[int]) → list[int]
Examples
in[[1,2,2,1],[2,2]]out[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
InputExpectedGot
[[1,2,2,1],[2,2]][2]not run yetsample