Maximum non-crossing lines
You are given two integer arrays a and b written on two horizontal lines. You may draw connecting lines between a[i] and b[j] only when a[i] == b[j], and no two connecting lines may cross (and each number is used at most once). Return the maximum number of connecting lines you can draw. Each array has at most 500 elements with values 1..2000.
Implement
max_uncrossed_lines(a: list[int], b: list[int]) → intExamples
in
[[1,4,2],[1,2,4]]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.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,4,2],[1,2,4]]2not run yetsample