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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1590. Make Sum Divisible by P

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact