Given an integer array nums, return the number of distinct triplets of indices (i, j, k) such that:

• $0 \leq$ i, j, k $<$ nums.length

• i, j, and k are pairwise distinct

• The sum nums[i] $+$ nums[j] $+$ nums[k] is divisible by exactly one of nums[i], nums[j], or nums[k]

Constraints:

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

• $1 \leq$ nums[i] $\leq 100$

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.