{"id":"group-contribution-sweep-pattern","text":"`countTriplets` uses a \"left * current * right\" sweep over Counter groups to count valid triplets in O(n) time, maintaining the invariant `left + c + right == len(nums)` at every iteration.","truth_value":"IN","source":"entries/2026/06/06/number-of-unequal-triplets-in-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"group-contribution-sweep-pattern","truth_value":"IN","reason":"premise"}]}}