# Box-Muller Transform For Gaussians: Practice Notes

Box-Muller Transform For Gaussians shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two uniform (0,1] draws u,v yield two independent normals via sqrt(-2 ln u) times cos or sin of 2 pi v.

## 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(1) per pair of samples.

## Common mistake

Allowing u=0, which makes the log explode.

## 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 https://www.linkjob.ai/.