# Super Pow: Study Guide
Super Pow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Compute a^b mod 1337 where b is a decimal array. Use Euler’s theorem (phi(1337)=phi(7*191)=1140) or expand a^b = (a^{b[:-1]})^10 * a^{b[-1]} recursively, taking mod 1337 at every multiply.
## 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(len(b)).
## Common mistake
Converting b to an int (it can be huge) or taking mod after a raw pow that already overflowed.
## 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 best AI tool for coding tests and OAs.