# BLAST Seed And Extend: Explained
BLAST Seed And Extend shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find short exact or high-scoring seeds with a lookup table, then extend each seed until the score drops below a threshold and report HSP statistics.
## 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
Average time far below full DP; worst-case still quadratic if every seed extends far.
## Common mistake
Extending a seed without an X-drop cutoff, which spends full DP time on unpromising alignments.
## 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.