GoLang Solution For LeetCode Problem: Combination Sum
Solving Combination Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
- The solution set must not contain duplicate combinations.
Input: candidates = [2,3,6,7], target = 7, A solution set is: [ , [2,2,3] ]
Input: candidates = [2,3,5], target = 8, A solution set is: [ [2,2,2,2], [2,3,3], [3,5] ]
See the full details of the problem Combination Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go