Maximum Alternating Sum Solution

Problem Statement

You are given an array of non-negative integers. Partition the array into 3 non-empty, non-overlapping, alternating groups such that the sum of the first group is greater than the sum of the second group. Determine the maximum sum of the groups with greater sums.

Constraints

• 1 <= resources.length <= 100
• 1 <= resources[i] <= 1000
• The number of groups is fixed at 3.