# Longest Common Subpath: Study Guide
Longest Common Subpath shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n cities and several paths (sequences of cities). The longest city-sequence that is a subarray (contiguous) of every path. Binary-search the length and check with rolling hashes of all windows of that length, intersecting the hash sets.
## 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(L log L) with hashing, L = total length.
## Common mistake
Using LCS of sequences (not requiring contiguity — the problem asks for a common subpath, i.e. a contiguous segment) or comparing windows with raw tuples without hashing (too slow).
## 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 AI interview copilot.