Leetcode 2578. Split With Minimum Sum

Partition the multiset of digits of a given positive integer into two nonnegative integers (reordering and leading zeros allowed) such that all digits are used and the sum of the two numbers is minimized. Core challenge: optimally assign digits to two numbers to minimize their place-value contributions (a greedy partition of the sorted digits).

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 2578. Split With Minimum Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact