chore(i8n,learn): processed translations

curriculum/challenges/espanol/10-coding-interview-prep/algorithms/no-repeats-please.md

@@ -0,0 +1,126 @@
+---
+id: a7bf700cd123b9a54eef01d5
+title: No Repeats Please
+challengeType: 5
+forumTopicId: 16037
+dashedName: no-repeats-please
+---
+
+# --description--
+
+Return the number of total permutations of the provided string that don't have repeated consecutive letters. Assume that all characters in the provided string are each unique.
+
+For example, `aab` should return 2 because it has 6 total permutations (`aab`, `aab`, `aba`, `aba`, `baa`, `baa`), but only 2 of them (`aba` and `aba`) don't have the same letter (in this case `a`) repeating.
+
+# --hints--
+
+`permAlone("aab")` should return a number.
+
+```js
+assert.isNumber(permAlone('aab'));
+```
+
+`permAlone("aab")` should return 2.
+
+```js
+assert.strictEqual(permAlone('aab'), 2);
+```
+
+`permAlone("aaa")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaa'), 0);
+```
+
+`permAlone("aabb")` should return 8.
+
+```js
+assert.strictEqual(permAlone('aabb'), 8);
+```
+
+`permAlone("abcdefa")` should return 3600.
+
+```js
+assert.strictEqual(permAlone('abcdefa'), 3600);
+```
+
+`permAlone("abfdefa")` should return 2640.
+
+```js
+assert.strictEqual(permAlone('abfdefa'), 2640);
+```
+
+`permAlone("zzzzzzzz")` should return 0.
+
+```js
+assert.strictEqual(permAlone('zzzzzzzz'), 0);
+```
+
+`permAlone("a")` should return 1.
+
+```js
+assert.strictEqual(permAlone('a'), 1);
+```
+
+`permAlone("aaab")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaab'), 0);
+```
+
+`permAlone("aaabb")` should return 12.
+
+```js
+assert.strictEqual(permAlone('aaabb'), 12);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permAlone(str) {
+  return str;
+}
+
+permAlone('aab');
+```
+
+# --solutions--
+
+```js
+function permAlone(str) {
+  return permuter(str).filter(function(perm) {
+    return !perm.match(/(.)\1/g);
+  }).length;
+}
+
+function permuter(str) {
+  // http://staff.roguecc.edu/JMiller/JavaScript/permute.html
+  //permArr: Global array which holds the list of permutations
+  //usedChars: Global utility array which holds a list of "currently-in-use" characters
+  var permArr = [], usedChars = [];
+  function permute(input) {
+    //convert input into a char array (one element for each character)
+    var i, ch, chars = input.split("");
+    for (i = 0; i < chars.length; i++) {
+      //get and remove character at index "i" from char array
+      ch = chars.splice(i, 1);
+      //add removed character to the end of used characters
+      usedChars.push(ch);
+      //when there are no more characters left in char array to add, add used chars to list of permutations
+      if (chars.length === 0) permArr[permArr.length] = usedChars.join("");
+      //send characters (minus the removed one from above) from char array to be permuted
+      permute(chars.join(""));
+      //add removed character back into char array in original position
+      chars.splice(i, 0, ch);
+      //remove the last character used off the end of used characters array
+      usedChars.pop();
+    }
+  }
+  permute(str);
+  return permArr;
+}
+
+permAlone('aab');
+```