Forked from anonymous/bonfire-mutations?solution=function%20mutation(arr)%20%7B%0A%20%20%0A%20%20var%20i%3D0%2Carr1%2Carr2%2Cletra%3B%0A%20%20%0A%20%20arr2%3D%20arr.pop().toLowerCase()%3B%0A%20%20arr2%3D%20arr2.split(%27%27)%3B%0A%20%20arr1%20%3D%20arr.pop(%27%27).toLower
Created
November 13, 2015 15:21
-
-
Save yurisbv/e5dafcdb81b79165943a to your computer and use it in GitHub Desktop.
http://www.freecodecamp.com/yurisbv 's solution for Bonfire: Mutations
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Bonfire: Mutations | |
| // Author: @yurisbv | |
| // Challenge: http://www.freecodecamp.com/challenges/bonfire-mutations?solution=function%20mutation(arr)%20%7B%0A%20%20%0A%20%20var%20i%3D0%2Carr1%2Carr2%2Cletra%3B%0A%20%20%0A%20%20arr2%3D%20arr.pop().toLowerCase()%3B%0A%20%20arr2%3D%20arr2.split(%27%27)%3B%0A%20%20arr1%20%3D%20arr.pop(%27%27).toLowerCase()%3B%0A%20%20arr1%20%3D%20arr1.split(%27%27)%3B%0A%20%20%0A%20%20for(i%3Bi%3Carr2.length%3Bi%2B%2B)%7B%0A%20%20%20%20%2F%2Fletra%3Darr2.pop()%3B%0A%20%20%20%20if%20(arr1.indexOf(arr2%5Bi%5D)%3D%3D%3D-1)%0A%20%20%20%20%20%20return%20false%3B%0A%20%20%7D%0A%20%20%0A%20%20return%20true%3B%0A%7D%0A%0Amutation(%5B%22hello%22%2C%20%22yeh%22%5D)%3B%0A | |
| // Learn to Code at Free Code Camp (www.freecodecamp.com) | |
| function mutation(arr) { | |
| var i=0,arr1,arr2,letra; | |
| arr2= arr.pop().toLowerCase(); | |
| arr2= arr2.split(''); | |
| arr1 = arr.pop('').toLowerCase(); | |
| arr1 = arr1.split(''); | |
| for(i;i<arr2.length;i++){ | |
| //letra=arr2.pop(); | |
| if (arr1.indexOf(arr2[i])===-1) | |
| return false; | |
| } | |
| return true; | |
| } | |
| mutation(["hello", "yeh"]); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment