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).