Zero Triplets — Solution & Editorial

Back to the Problem

Sort and two-pointer per anchor, multiplying duplicate-run lengths when a match is found (the equal-values case collapses to C(k,2)). An O(N²) map approach also fits.

Complexity: O(N²)

Watch out: Counting by index with duplicate values is the hard part — run-length multiply, don't skip.