Leetcode 3551. Minimum Swaps to Sort by Digit Sum

Given an array of distinct positive integers, reorder it by increasing digit-sum (breaking ties by the smaller numeric value) and return the minimum number of swaps needed to reach that order. This reduces to building the target permutation and computing the minimum swaps via cycle decomposition of the permutation.