# Metropolis Hastings MCMC: Explained
Metropolis Hastings MCMC shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
From the current state, propose a neighbor and accept it with probability min(1, (pi(y) q(x|y)) / (pi(x) q(y|x))) so the chain has the target as stationary distribution.
## 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
Mixing time depends on the conductance of the chain; each step is one proposal plus one density-ratio evaluation.
## Common mistake
Dropping the proposal-ratio q(x|y)/q(y|x) on an asymmetric proposal, which samples the wrong stationary distribution.
## 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 job search and interview copilot.