Leetcode 2198. Number of Single Divisor Triplets

Given an integer array, count triplets of indices (i, j, k) such that exactly one element of the triplet divides both of the other two. Solve efficiently by leveraging value frequencies and enumerating divisors/multiples (rather than checking all O(n^3) triplets) to compute combinatorial counts.