# Pohlig Hellman Discrete Log: Interview Notes

Pohlig Hellman Discrete Log shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Solve the discrete log modulo each prime-power factor of the group order, then combine with CRT, so smooth orders become easy.

## 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(sum e_i (log n + sqrt(p_i))) roughly.

## Common mistake

Running baby-step giant-step on the full group order when the order factors are known and small.

## 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 interview assistant.