Status: IN
Pair-counting solutions use `n*(n-1)//2` per frequency group (or the incremental equivalent `count += seen[x]; seen[x] += 1`) rather than enumerating all pairs; integer division is exact because one of two consecutive integers is always even.
Source: entries/2026/06/06/number-of-equivalent-domino-pairs-solution.md