LeetCode 372: Super Pow
Problem Restatement We are given: Variable Meaning a Positive integer base b Very large exponent represented as an array of digits We need to compute: a^b mod 1337 The exponent can be extremely large, so we cannot convert the entire digit array into a normal integer directly. The problem statement defines: b = [1, 2, 3] as the exponent: 123 The modulus is always: 1337 The official examples include: a...