-
Notifications
You must be signed in to change notification settings - Fork 335
Expand file tree
/
Copy path13 Bonfire Mutations.js
More file actions
35 lines (25 loc) · 973 Bytes
/
13 Bonfire Mutations.js
File metadata and controls
35 lines (25 loc) · 973 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/* Bonfire: Mutations
Difficulty: 1/5
Return true if the string in the first element of the array contains 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'.
Lastly, ['Alien', 'line'], should return true because all of the letters in 'line' are present in
'Alien'.
Remember to use RSAP if you get stuck. Try to pair program. Write your own code.
Here are some helpful links:
Array.indexOf()
Code by Rafael Rodriguez
rafase282@gmail.com
http://www.freecodecamp.com/rafase282
*/
function mutation(arr) {
var str = arr[0].toLowerCase().split('');
var match = arr[1].toLowerCase().split('');
return match.every(function(char){
return str.indexOf(char) !== -1;
});
}
mutation(["hello", "hey"]);