Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3551. Minimum Swaps to Sort by Digit Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source