--description--

For all numbers greater than and equal to 1, create an else block and inside it, call the countup function with number - 1 and assign the result to countArray.

Then use .push() to add number to countArray, and finally return countArray.

This ensures the recursion eventually reaches the base case and terminates.

--hints--

You should assign the result of calling countup with number - 1 to countArray.

assert.match(countup.toString(), /countArray\s*=\s*countup\(\s*number\s*-\s*1\s*\)/);

You should push number into countArray.

assert.match(countup.toString(), /countArray\.push\(\s*number\s*\)/);

You should return the countArray.

assert.deepStrictEqual(countup(3), [1, 2, 3]);

--seed--

--seed-contents--

function countup(number) {
  let countArray = [];
  if (number < 1) {
    return [];
--fcc-editable-region--
  }
  
--fcc-editable-region--
}