DEV Community


Posted on


LeetCode 39. Combination Sum (javascript solution)


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.

It is guaranteed that the number of unique combinations that sum up to target is less than 150 combinations for the given input.


Time Complexity : O(n!)
Space Complexity: O(n!)

var combinationSum = function(candidates, target) {
       const result = [];

    // Backtracking function to create permutations
    function permute(arr=[], sum=0, idx=0) {
        if(sum > target) return;
        if(sum === target) result.push(arr);

        // Start i at idx to avoid using the same combination of numbers but in a different order
        for(let i = idx; i < candidates.length; i++) {
            permute([...arr, candidates[i]], sum+candidates[i], i);
    return result; 
Enter fullscreen mode Exit fullscreen mode

Top comments (2)

qurashieman profile image
Tuba Inam

I found that solution is very popular and helpful: