# Longest Common Subsequence Between Sorted Arrays: Explained
Longest Common Subsequence Between Sorted Arrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Several already-sorted arrays; return the values that appear in every array, in increasing order. Count frequencies across arrays (each array contributes a value at most once) or repeatedly intersect with a two-pointer walk.
## 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(total length).
## Common mistake
Running a general LCS DP (unnecessary once arrays are sorted) or counting duplicates inside one array more than once.
## 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 www.linkjob.ai.