GoLang Solution For LeetCode Problem: Partition Equal Subset Sum
Solving Partition Equal Subset Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
- Each of the array element will not exceed 100.
- The array size will not exceed 200.
Input: [1, 5, 11, 5] Output: true Explanation: The array can be partitioned as [1, 5, 5] and .
Input: [1, 2, 3, 5] Output: false Explanation: The array cannot be partitioned into equal sum subsets.
See the full details of the problem Partition Equal Subset Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go