Leetcode 3265. Count Almost Equal Pairs I

Count the number of index pairs (i<j) such that one number can be transformed into the other by performing at most one swap of two digits within a single number (swaps may create leading zeros). In other words, determine how many pairs of string representations differ by at most a single intra-number digit swap.