[LeetCode] Number of Divisible Triplet Sums

2964. Number of Divisible Triplet Sums Given a 0-indexed integer array nums and an integer d, return the number of triplets (i, j, k) such that i < j < k and (nums[i] + nums[j] + nums[k]) % d == 0. ...