[LeetCode] Split With Minimum Sum

2578. Split With Minimum Sum

Given a positive integer num, split it into two non-negative integers num1 and num2 such that:

  • The concatenation of num1 and num2 is a permutation of num.
  • In other words, the sum of the number of occurrences of each digit in num1 and num2 is equal to the number of occurrences of that digit in num.
  • num1 and num2 can contain leading zeros.

Return the minimum possible sum of num1 and num2.

Notes:

  • It is guaranteed that num does not contain any leading zeros.
  • The order of occurrence of the digits in num1 and num2 may differ from the order of occurrence of num.
Read more
[AtCoder] E - Spread of InformationRead more
[AtCoder] E - Level K PalindromeRead more
[AtCoder] D - Miracle TreeRead more
[AtCoder] F - Graph SmoothingRead more
[AtCoder] F - Encounter and FarewellRead more
[Codeforces] Round 359 (Div. 1) A. Robbers` watchRead more
[Codeforces] Round 361 (Div. 2) C. Mike and Chocolate ThievesRead more
[Codeforces] Helvetic Coding Contest 2016 online mirror (teams, unrated) B1. Recover Polygon (easy)Read more
[Codeforces] Educational Round 14 D. Swaps in PermutationRead more