--- title: Combinations id: 5958469238c0d8d2632f46db challengeType: 5 --- ## Description
Task:

Given non-negative integers m and n, generate all size m combinations of the integers from 0 (zero) to n-1 in sorted order (each combination is sorted and the entire table is sorted).

Example:

3 comb 5 is:

0 1 2
0 1 3
0 1 4
0 2 3
0 2 4
0 3 4
1 2 3
1 2 4
1 3 4
2 3 4
## Instructions
## Tests
```yml tests: - text: combinations is a function. testString: 'assert(typeof combinations === "function", "combinations is a function.");' - text: 'combinations(3, 5) should return [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]].' testString: 'assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1, "combinations(3, 5) should return [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]].");' - text: 'combinations(4, 6) should return [[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]' testString: 'assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2, "combinations(4, 6) should return [[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]");' ```
## Challenge Seed
```js function combinations (m, n) { // Good luck! return true; } ```
### After Test
```js console.info('after the test'); ```
## Solution
```js function combinations (m, n) { const nArr = [...Array(n).keys()]; return (function generateCombinations (size, numArr) { const ret = []; for (let i = 0; i < numArr.length; i++) { if (size === 1) { ret.push([numArr[i]]); } else { const sub = generateCombinations(size - 1, numArr.slice(i + 1, numArr.length)); for (let subI = 0; subI < sub.length; subI++) { const next = sub[subI]; next.unshift(numArr[i]); ret.push(next); } } } return ret; }(m, nArr)); } ```