-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmutations.js
37 lines (26 loc) · 1.22 KB
/
mutations.js
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
36
37
/*
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".
*/
function mutation(arr) {
let first = arr[0].toLowerCase();
// console.log(first);
let second = arr[1].toLowerCase();
// console.log(second);
for (var i = 0; i < second.length; i++) {
if (first.indexOf(second[i]) < 0)
return false;
}
return true;
}
mutation(["hello", "hey"]);
mutation(["hello", "Hello"]) //should return true.
mutation(["zyxwvutsrqponmlkjihgfedcba", "qrstu"]) //should return true.
mutation(["Mary", "Army"]) //should return true.
mutation(["Mary", "Aarmy"]) //should return true.
mutation(["Alien", "line"]) //should return true.
mutation(["floor", "for"]) //should return true.
mutation(["hello", "neo"]) // should return false.
mutation(["voodoo", "no"]) //should return false.