Given a positive integer a and an array of digits b representing a large positive integer, calculate a raised to the power of b modulo $1337$, that is, $a^b \bmod 1337$.

Constraints:

• $1 \leq$ a $\leq 2^{31} - 1$

• $1 \leq$ b.length $\leq 2000$

• $0 \leq$ b[i] $\leq 9$

• b does not contain leading zeros.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.