Make Sum Divisible by P Python Solution

lcpy gen -n 1590   # by problem number
lcpy gen -s make_sum_divisible_by_p   # by problem name

Input: nums = [3,1,4,2], p = 6
Output: 1
Explanation: The sum of the elements in nums is 10, which is not divisible by 6. We can remove the subarray [4], and the sum of the remaining elements is 6, which is divisible by 6.

Input: nums = [6,3,5,2], p = 9
Output: 2
Explanation: We cannot remove a single element to get a sum divisible by 9. The best way is to remove the subarray [5,2], leaving us with [6,3] with sum 9.

Input: nums = [1,2,3], p = 3
Output: 0
Explanation: Here the sum is 6. which is already divisible by 3. Thus we do not need to remove anything.

class Solution:
    # Time: O(n)
    # Space: O(min(n, p))
    def min_subarray(self, nums: list[int], p: int) -> int:
        total = sum(nums) % p
        if total == 0:
            return 0
        n = len(nums)
        last = {0: -1}
        cur = 0
        best = n
        for i, num in enumerate(nums):
            cur = (cur + num) % p
            need = (cur - total) % p
            if need in last:
                best = min(best, i - last[need])
            last[cur] = i
        return -1 if best == n else best