Count Distinct Pairs

Problem Overview

• Count distinct pairs (x, y) with 0 ≤ x < y where fruits[x] can be formed from fruits[y] by swapping at most two digits (zero swap allowed, equal values count).
• Input: array fruits of integers; Output: total number of such pairs; Constraints: length 1 to 10^4, values 1 to 10^9.
• Domain: pair counting with digit-based equivalence in arrays, relevant to number manipulation.
• This Databricks interviews coding interview problem is a common interview question.