# Finding all possible combinations from an array in JavaScript

JavascriptWeb DevelopmentFront End TechnologyObject Oriented Programming

#### JavaScript for beginners

Best Seller

74 Lectures 10 hours

#### Modern Javascript for Beginners + Javascript Projects

Most Popular

112 Lectures 15 hours

#### The Complete Full-Stack JavaScript Course!

Best Seller

96 Lectures 24 hours

We are required to write a JavaScript function that takes in an array of Numbers as the first argument and a target sum as the second argument. The function should construct an array of array of all such elements from the array (repeating or non-repeating) that adds up to the target sum.

For example − If the input array is −

const arr = [2, 3, 6, 7], sum = 7;

Therefore, the output for the above input should look like this −

const output = [
[2, 2, 3],

];

## Example

The code for this will be −

const arr = [2, 3, 6, 7], sum = 7;
const combineElements = (arr, sum) => {
const output = [];
const findCombination = (remain, path, start) => {
if (remain < 0) {
return;
}
if (remain === 0) {
output.push([...path]);
return;
}
for (let i = start; i < arr.length; i++) {
findCombination(remain − arr[i], [...path, arr[i]], i);
}
}
findCombination(sum, [], 0);
return output;
};
console.log(combineElements(arr, sum));

## Output

And the output in the console will be −

[ [ 2, 2, 3 ], [ 7 ] ]