# Extended Euclid For Diophantine Equations: Interview Notes

Extended Euclid For Diophantine Equations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find x, y with ax + by = gcd(a, b); scale by c/g if g divides c.

## 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(log min(a, b)).

## Common mistake

Not checking that gcd divides c before scaling.

## 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 linkjob.ai.