freeCodeCamp/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
afcc8d540bea9ea2669306b6	Repetir una cadena repetir una cadena	5	16041	repeat-a-string-repeat-a-string

--description--

Repita una cadena dada str (primer argumento) por num veces (segundo argumento). Retorne una cadena vacía si num no es un número positivo. Para este desafío, utiliza not el método .repeat() incorporado.

--hints--

repeatStringNumTimes("*", 3) debe devolver "***".

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

repeatStringNumTimes("abc", 3) debe devolver "abcabcabc".

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

repeatStringNumTimes("abc", 4) debe devolver "abcabcabcabc".

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

repeatStringNumTimes("abc", 1) debe devolver "abc".

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

repeatStringNumTimes("*", 8) debe devolver "********".

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

repeatStringNumTimes("abc", -2) debe devolver "".

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

El método integrado repeat() no debe ser utilizado.

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

repeatStringNumTimes("abc", 0) debe devolver "".

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);