Solving Super Pow in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: a = 2, b = [3]
Output: 8

Example 2:

Input: a = 2, b = [1,0]
Output: 1024

    12345^678 % 1337 = (12345^670 * 12345^8) % 1337

See the full details of the problem Super Pow at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go