Leetcode 1590. Make Sum Divisible by P

Find the shortest non-empty (or possibly empty) contiguous subarray to remove (but not the entire array) so that the remaining elements' sum is divisible by p. This reduces to finding the minimal-length subarray whose sum % p equals totalSum % p — solvable via prefix-sum modulo arithmetic with a hash map of seen remainders.