construct/rlve distinct subset sum permutation
construct/rlve distinct subset sum permutation: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). You are given an array A of 4 distinct integers: A = 2, 3, 0, 4 (positions 1..4).
The task
You are given an array A of 4 distinct integers: A = [2, 3, 0, 4] (positions 1..4).