mediumBacktrackingGreedyMath 0 views

Maximum Split of Positive Even Integers

You are given an integer finalSum.

You are given an integer finalSum. Split it into a sum of a maximum number of unique positive even integers.

Return a list of integers that represent a valid split containing a maximum number of integers. If no valid split exists for finalSum, return an empty list. You may return the integers in any order.

Example 1

Input: finalSum = 12

Output: [2,4,6]

Explanation: The following are valid splits: (12), (2 + 10), (2 + 4 + 6), and (4 + 8). (2 + 4 + 6) has the maximum number of integers, which is 3. Thus, we return [2,4,6]. Note that [2,6,4], [6,2,4], etc. are also accepted.

Example 2

Input: finalSum = 7

Output: []

Explanation: There are no valid splits for the given finalSum. Thus, we return an empty array.

Example 3

Input: finalSum = 28

Output: [6,8,2,12]

Explanation: The following are valid splits: (2 + 26), (6 + 8 + 2 + 12), and (4 + 24). (6 + 8 + 2 + 12) has the maximum number of integers, which is 4. Thus, we return [6,8,2,12]. Note that [10,2,4,12], [6,2,4,16], etc. are also accepted.

Constraints

  • 1 <= finalSum <= 1010

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.