Given rods of various lengths, build two supports of equal height by welding subsets of rods together (each rod used at most once, and rods may be left unused). Return the largest possible common height, or 0 if no two disjoint subsets have equal sums. The input is JSON {rods}.
Input: JSON {rods}.
Output: Integer — the tallest achievable equal height.
Input: {"rods":[1,2,3,6]}
Output: 6
Explanation: 1+2+3 equals 6.Input: {"rods":[1,2,3,4,5,6]}
Output: 10
Explanation: Two disjoint subsets sum to 10.Input: {"rods":[1,2]}
Output: 0
Explanation: No equal split exists.1<=n<=20