LeetCode | Make Sum Divisible by P | C++ | Golang | Rust

In this video, I break down LeetCode 1590 – Make Sum Divisible by P using a clear mathematical intuition and step-by-step prefix sum reasoning.
I explain why we search for a subarray whose sum has a specific modulo, derive the formula using prefix sums on the board, and show how to find the minimum length subarray to remove so that the remaining array becomes divisible by p.

⏱ Timestamps

00:00 – Problem Statement and Logic
10:28 – C++ Implementation
17:39 – Time Complexity and Space complexity
19:59 – Golang Implementation
23:38 – Rust Implementation

Using visual sketches, I explain:

How prefix sum mod logic helps find the required subarray

Why we compute (pre - rem + p) % p

How HashMap stores prefix remainders and their latest indices

Time complexity improvements using prefix modulo + hashmap

Full solutions in C++, Golang, and Rust

Then I implement the complete solution in all three languages.
Rust example includes clean HashMap usage and O(n) logic.

Perfect for LeetCode Daily, interview prep, and competitive programming!

Видео LeetCode | Make Sum Divisible by P | C++ | Golang | Rust канала AlgorithmsUntilRED