Combination Sum: Finds combination of numbers within a given collection where the sum of the set equals the input target

combinationSum.js

function findNumberCombinations(numbers, target) {
  const result = [];

  function backtrack(index, currentCombination, currentSum) {
    if (currentSum === target) {
      result.push([...currentCombination]);
      return;
    }

    if (currentSum > target || index >= numbers.length) {
      return;
    }

    for (let i = index; i < numbers.length; i++) {
      const num = numbers[i];
      if (i > index && numbers[i] === numbers[i - 1]) {
        continue; // Skip duplicate numbers
      }
      currentCombination.push(num);
      backtrack(i + 1, currentCombination, currentSum + num);
      currentCombination.pop();
    }
  }

  numbers.sort((a, b) => a - b); // Sort the input set in ascending order
  backtrack(0, [], 0);

  return result;
}