Number of Divisible Triplet Sums

Statement

Given an integer array nums and an integer d, count the number of index triplets (i, j, k) such that $i < j < k$ ...