Maximum split of positive even integers

Math Backtracking Greedy

59.6% acceptance

Feb 25, 2026

825

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, return an empty list.

Solution

Rust

Time O(n)

Space O(n)

LeetCode

solution.rs

impl Solution {
  pub fn maximum_even_split(final_sum: i64) -> Vec<i64> {
    if final_sum % 2 != 0 {
      return vec![];
    }
    let mut result = Vec::new();
    let mut remaining = final_sum;
    let mut cur = 2i64;
    while remaining > 0 {
      if remaining - cur > cur {
        result.push(cur);
        remaining -= cur;
      } else {
        result.push(remaining);
        break;
      }
      cur += 2;
    }
    result
  }
}