Files
freeCodeCamp/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
abe 4ab1dd8926 fix(curriculum): recursion challenges that abuse global space (#47680)
* fix: recursion challenges that abuse global space #43516

* fix challenge phrasing and create separate test

* fix: challenges which pollute/impure functions should not pass

* Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register.md

allow users to ab(use) global space in cash register

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

* Update curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md

allow users to abuse global space in roman numeral converter

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: kravmaguy <flex4lease@gmail.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2022-10-12 15:00:24 -05:00

2.1 KiB

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5cc0bd7a49b71cb96132e54c Use Recursion to Create a Range of Numbers 1 301180 use-recursion-to-create-a-range-of-numbers

--description--

Continuing from the previous challenge, we provide you another opportunity to create a recursive function to solve a problem.

--instructions--

We have defined a function named rangeOfNumbers with two parameters. The function should return an array of integers which begins with a number represented by the startNum parameter and ends with a number represented by the endNum parameter. The starting number will always be less than or equal to the ending number. Your function must use recursion by calling itself and not use loops of any kind. It should also work for cases where both startNum and endNum are the same.

--hints--

Your function should return an array.

assert(Array.isArray(rangeOfNumbers(5, 10)));

Your code should not use any loop syntax (for or while or higher order functions such as forEach, map, filter, or reduce).

assert(
  !code.match(/for|while|forEach|map|filter|reduce/g)
);

rangeOfNumbers should use recursion (call itself) to solve this challenge.

assert(
  rangeOfNumbers.toString().match(/rangeOfNumbers\s*\(.+\)/)
);

rangeOfNumbers(1, 5) should return [1, 2, 3, 4, 5].

assert.deepStrictEqual(rangeOfNumbers(1, 5), [1, 2, 3, 4, 5]);

rangeOfNumbers(6, 9) should return [6, 7, 8, 9].

assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);

rangeOfNumbers(4, 4) should return [4].

assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);

Global variables should not be used to cache the array.

rangeOfNumbers(1, 3)
assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);

--seed--

--seed-contents--

function rangeOfNumbers(startNum, endNum) {
  return [];
};

--solutions--

function rangeOfNumbers(startNum, endNum) {
  if (endNum - startNum === 0) {
    return [startNum];
  } else {
    const numbers = rangeOfNumbers(startNum, endNum - 1);
    numbers.push(endNum);
    return numbers;
  }
}