Leetcode 1035. Uncrossed Lines

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1035. Uncrossed Lines

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact