Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 372. Super Pow
Compute a^b mod 1337 where a is an integer and b is an extremely large exponent given as an array of decimal digits; the key challenge is handling the huge exponent by processing digits and using modular exponentiation with exponent decomposition (e.g., a^(10x+d) = (a^10)^x * a^d).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.