Maximize Groups

Given an integer array nums, the task is to partition these integers into several groups, where each group's number of elements is at least 2, and the sum of elements in each group cannot be concatenated as the sum of elements in another group. Each element can be used only once. Find the maximum number of groups you can form. Provide your algorithm and analyze its time and space complexity. Example Input 5 2 3 4 5 6