# Uncrossed Lines: Interview Notes

Uncrossed Lines shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may draw a straight line between nums1[i] and nums2[j] when the values are equal and lines do not cross. That is exactly LCS of the two arrays: DP[i][j] = DP[i-1][j-1]+1 on a match, else max of skip-either.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(nm).

## Common mistake

Greedy matching the first occurrence of each value, which can block a better later pairing.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at undetectable AI interview copilot.