Available question text
Given two integer arrays, pair equal elements with straight lines so that lines don't cross and each element is used at most once; return the maximum number of such pairs. This is equivalent to finding the longest common subsequence (LCS) between the two arrays (classic DP problem; lengths ≤ 500).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1035. Uncrossed Lines
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source