Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 372 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 372 # by problem number
lcpy gen -s super_pow # by problem name
a is a positive integer and b is an extremely large positive integer given in the form of an array.
Input: a = 2, b = [3]
Output: 8
Input: a = 2, b = [1,0]
Output: 1024
Input: a = 1, b = [4,3,3,8,5,2]
Output: 1
b does not contain leading zeros.class Solution:
# Time: O(n) where n = len(b)
# Space: O(1)
def super_pow(self, a: int, b: list[int]) -> int:
mod = 1337
result = 1
a %= mod
for digit in b:
result = (pow(result, 10, mod) * pow(a, digit, mod)) % mod
return result
| Time | Space |
|---|---|
| O(n) where n = len(b) | O(1) |