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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3551. Minimum Swaps to Sort by Digit Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact