#2578
Split With Minimum Sum
newbie · 255 · lc easy +19 · verified · 73.3% accepted · 427 likes · top 83%
Description
Given a positive integer num (no leading zeros), distribute its digits (in any order) between two non-negative integers num1 and num2 — using every digit of num exactly once across the pair (leading zeros in either number are allowed). Return the minimum possible sum num1 + num2.
Example 1:
Input: num = 4325
Output: 59
Explanation: We can split 4325 so that num1 is 24 and num2 is 35, giving a sum of 59. We can prove that 59 is indeed the minimal possible sum.
Example 2:
Input: num = 687
Output: 75
Explanation: We can split 687 so that num1 is 68 and num2 is 7, which would give an optimal sum of 75.
Code
1
2
3