# de Bruijn Graph Assembly: Practice Notes
de Bruijn Graph Assembly shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Make a vertex for every (k-1)-mer and a directed edge for every k-mer so an Eulerian path through the graph reconstructs a sequence that contains each k-mer.
## 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(N) vertices and edges for N distinct k-mers; Hierholzer reconstructs a path in linear time.
## Common mistake
Choosing k so small that repeats collapse into branched vertices and the Eulerian path is no longer unique.
## 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 help for online coding assessments.