Oliver Eyton-Williams 0bd52f8bd1

and change all the challenges to new `md` format.

2020-11-27 10:02:05 -08:00

1.6 KiB

Raw Blame History

id, title, challengeType, forumTopicId

id	title	challengeType	forumTopicId
afcc8d540bea9ea2669306b6	Repeat a String Repeat a String	5	16041

--description--

Repeat a given string str (first argument) for num times (second argument). Return an empty string if num is not a positive number. For the purpose of this challenge, do not use the built-in .repeat() method.

--hints--

repeatStringNumTimes("*", 3) should return "***".

assert(repeatStringNumTimes('*', 3) === '***');

repeatStringNumTimes("abc", 3) should return "abcabcabc".

assert(repeatStringNumTimes('abc', 3) === 'abcabcabc');

repeatStringNumTimes("abc", 4) should return "abcabcabcabc".

assert(repeatStringNumTimes('abc', 4) === 'abcabcabcabc');

repeatStringNumTimes("abc", 1) should return "abc".

assert(repeatStringNumTimes('abc', 1) === 'abc');

repeatStringNumTimes("*", 8) should return "********".

assert(repeatStringNumTimes('*', 8) === '********');

repeatStringNumTimes("abc", -2) should return "".

assert(repeatStringNumTimes('abc', -2) === '');

The built-in repeat() method should not be used.

assert(!/\.repeat/g.test(code));

repeatStringNumTimes("abc", 0) should return "".

assert(repeatStringNumTimes('abc', 0) === '');

--seed--

--seed-contents--

function repeatStringNumTimes(str, num) {
  return str;
}

repeatStringNumTimes("abc", 3);

--solutions--

function repeatStringNumTimes(str, num) {
  if (num < 1) return '';
  return num === 1 ? str : str + repeatStringNumTimes(str, num-1);
}

repeatStringNumTimes("abc", 3);

1.6 KiB Raw Blame History