update instructions for Bonfire: Mutations

pull/486/head^2
terakilobyte 2015-05-26 00:04:50 -04:00
parent 873a0082a0
commit 47d350aa27
1 changed files with 3 additions and 1 deletions

View File

@ -349,10 +349,11 @@
"name": "Bonfire: Mutations",
"difficulty": "1.12",
"description": [
"Return true if the string in the first element of the array contains the letters of the string in the second element of the array.",
"Return true if the string in the first element of the array contains the all of the letters of the string in the second element of the array.",
"For example, ['hello', 'Hello'], should return true because all of the letters in the second string are present in the first, ignoring case.",
"The arguments ['hello', 'hey'] should return false because the string 'hello' does not contain a 'y'.",
"Another example, ['Alien', 'line'], should return true because all of the letters in 'line' are present in 'Alien'.",
"Lastly, ['Mary', 'Aarmy'] should return false because 'Mary' is only 4 letters while 'Aarmy' is 5, so 'Mary' can't possibly contain 'Aarmy'",
"Remember to use <a href='/field-guide/how-do-i-get-help-when-I-get-stuck'>RSAP</a> if you get stuck. Try to pair program. Write your own code."
],
"challengeSeed": [
@ -367,6 +368,7 @@
"expect(mutation(['hello', 'Hello'])).to.be.true;",
"expect(mutation(['zyxwvutsrqponmlkjihgfedcba', 'qrstu'])).to.be.true;",
"expect(mutation(['Mary', 'Army'])).to.be.true;",
"expect(mutation(['Mary', 'Aarmy'])).to.be.false;",
"expect(mutation(['Alien', 'line'])).to.be.true;"
],
"MDNlinks": ["Array.sort()"],