Invesco Tech Challenge 2025 | Minimal Absolute Difference Partitions & Global Asset Value Escalation Sequence

Problem 1 - Minimal Absolute Difference Partitions Problem Statement You are given an array of N positive integers arr. You must split the entire array into exactly two non-empty subsets such that: Every element belongs to exactly one subset. No element can belong to both subsets. Let: S1 = Sum of elements in the first subset S2 = Sum of elements in the second subset Your task is to minimize: |S1 - S2| Return the minimum possible absolute difference. Constraints ...