# Berlekamp Massey Recurrence Find: Walkthrough
Berlekamp Massey Recurrence Find shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Recover the shortest linear recurrence that generates a sequence by maintaining the current discrepancy and updating the polynomial when it fails.
## 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^2) field operations.
## Common mistake
Updating the polynomial without saving the previous failure length, which produces a longer-than-necessary recurrence.
## 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 real-time AI interview assistant for live interviews.