You are given an integer array nums and an integer k.

In one operation, you can select any contiguous subarray of nums whose sum of elements is divisible by k and remove it from the array. When a subarray is removed, the remaining elements on both sides merge together to form the updated array.

Return the minimum possible sum of the remaining elements in nums after performing this operation any number of times.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^6$

• $1 \leq$ k $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.