freeCodeCamp/no-repeats-please.spanish.md at b31fce700dd5f9f433acad7be735f67b17a504f2

Files

Mo Zargham 437ba8b103 fix(curriculum): Read-search-ask link now point to correct url as noted in the issue (#37753 )

* fix: broken Read-search-ask link now point to correct url

* fix: changed link to original forum link with more views

* fix: changed http links to correct version

* fix: link in help modal

2019-11-19 19:54:48 -05:00

3.1 KiB

Raw Blame History

id, title, challengeType, videoUrl, localeTitle

id	title	challengeType	videoUrl	localeTitle
a7bf700cd123b9a54eef01d5	No Repeats Please	5		No se repite por favor

Description

Devuelve el número de permutaciones totales de la cadena proporcionada que no tienen letras consecutivas repetidas. Supongamos que todos los caracteres de la cadena proporcionada son únicos. Por ejemplo, aab debe devolver 2 porque tiene 6 permutaciones totales ( aab , aab , aba , aba , baa , baa ), pero solo 2 de ellas ( aba y aba ) no tienen la misma letra (en este caso a ) repitiendo Recuerda usar Read-Search-Ask si te atascas. Trate de hacer programación en pareja. Escribe tu propio código.

Instructions

Tests

tests:
  - text: <code>permAlone(&quot;aab&quot;)</code> debe devolver un número.
    testString: 'assert.isNumber(permAlone("aab"), "<code>permAlone("aab")</code> should return a number.");'
  - text: <code>permAlone(&quot;aab&quot;)</code> debe devolver 2.
    testString: 'assert.strictEqual(permAlone("aab"), 2, "<code>permAlone("aab")</code> should return 2.");'
  - text: <code>permAlone(&quot;aaa&quot;)</code> debe devolver 0.
    testString: 'assert.strictEqual(permAlone("aaa"), 0, "<code>permAlone("aaa")</code> should return 0.");'
  - text: <code>permAlone(&quot;aabb&quot;)</code> debe devolver 8.
    testString: 'assert.strictEqual(permAlone("aabb"), 8, "<code>permAlone("aabb")</code> should return 8.");'
  - text: <code>permAlone(&quot;abcdefa&quot;)</code> debe devolver 3600.
    testString: 'assert.strictEqual(permAlone("abcdefa"), 3600, "<code>permAlone("abcdefa")</code> should return 3600.");'
  - text: <code>permAlone(&quot;abfdefa&quot;)</code> debe devolver 2640.
    testString: 'assert.strictEqual(permAlone("abfdefa"), 2640, "<code>permAlone("abfdefa")</code> should return 2640.");'
  - text: <code>permAlone(&quot;zzzzzzzz&quot;)</code> debe devolver 0.
    testString: 'assert.strictEqual(permAlone("zzzzzzzz"), 0, "<code>permAlone("zzzzzzzz")</code> should return 0.");'
  - text: <code>permAlone(&quot;a&quot;)</code> debe devolver 1.
    testString: 'assert.strictEqual(permAlone("a"), 1, "<code>permAlone("a")</code> should return 1.");'
  - text: <code>permAlone(&quot;aaab&quot;)</code> debe devolver 0.
    testString: 'assert.strictEqual(permAlone("aaab"), 0, "<code>permAlone("aaab")</code> should return 0.");'
  - text: <code>permAlone(&quot;aaabb&quot;)</code> debe devolver 12.
    testString: 'assert.strictEqual(permAlone("aaabb"), 12, "<code>permAlone("aaabb")</code> should return 12.");'

Challenge Seed

function permAlone(str) {
  return str;
}

permAlone('aab');

Solution

// solution required

3.1 KiB Raw Blame History