Given an integer array nums and an integer d, count the number of index triplets (i, j, k) such that $i < j < k$ and the sum nums[i] + nums[j] + nums[k] is divisible by d.

Return the total number of such triplets.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

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

• $1 \leq$ d $\leq 10^9$

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.