My Golang solution to the combination sum problem.

39. Combination Sum

https://leetcode.com/problems/combination-sum/

Description

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.

Example 1:

Input: candidates = [2,3,6,7], target = 7
Output: [[2,2,3],[7]]
Explanation:
2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times.
7 is a candidate, and 7 = 7.
These are the only two combinations.

Example 2:

Input: candidates = [2,3,5], target = 8
Output: [[2,2,2,2],[2,3,3],[3,5]]

Solution - backtracking


func combinationSum(candidates []int, target int) [][]int {
    results := [][]int{}
    combineAndBacktrack(candidates, 0, []int{}, target, &results)
    
    return results
}
func combineAndBacktrack(candidates []int, index int, comb []int, remain int, results *[][]int){
    if remain == 0 {
        *results = append(*results, comb)
        return
    }
    
    if remain < 0 {
        return
    }
    
    for i := index; i < len(candidates); i++ {
        candidate :=  candidates[i]
        comb = append(comb, candidate)
        nextComb := make([]int, len(comb))
        copy(nextComb, comb)
        combineAndBacktrak(candidates, i, nextComb, remain - candidate, results)
        comb = comb[:len(comb)-1]
    }
}

Comments

▲