CodingMediumcod-g942

Subject Dynamic programming 2dLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[1,4,2],[1,2,4]]out2

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.

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.