# Longest Common Subsequence: Interview Notes
Longest Common Subsequence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
dp[i][j] = dp[i-1][j-1]+1 on a match, else max(dp[i-1][j], dp[i][j-1]).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(nm).
## Common mistake
Requiring the letters to be a substring (contiguous), which is a different problem.
## 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 this tool.