SEEK AND DESTROY

In this challenge we are provided with an initial array i.e the first argument in the destroyer function It is followed by one or more arguments. We have to remove all elements from the first array that are of the same value as are these arguments.

Following clues are given for reference:

• Arguments object

• Array.filter()

To be frank I have to sweat out a lot with this algorithm, First it took me a while to get my head around the Arguments Objects. I used  Read-Search-Ask technique to get more clues and finally after a lot of efforts i got to the following solution.

My solution for the problem is given below:

   function destroyer(arr) {
       arr1 = [];         //create a new array of arguments
       for ( i = 1; i < arguments.length; i++){
           j = arguments[i];
           arr1.push(j);
       }
       function checker(value) {   // returns items not in index
           return arr1.indexOf(value) === -1;
       }
       return arr.filter(checker);  //Filter the items given by 
                                    //checker func
   }

MUTATIONS

This Challenge requires to 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"], have to return true because all of the letters in the second string are present in the first, after ignoring case.

The arguments ["hello", "hey"] should have to return false because the string in first element "hello" does not contain a "y".

Similarly, ["Alien", "line"], should be returning true because all of the letters in "line" are there in "Alien".

Clue in the form of helpful links is as given below. Its a clickable link leading to MDN documentation to study more about the string method indexOf():

• String.indexOf()

Again using a little trail & error and the Read-Search-Ask technique. I can up with following solution.



                       function mutation(arr) {
                     var a = arr[0].toLowerCase();
                     var b = arr[1].toLowerCase();
                     if (a === b) {
                         return true;
                     } else {
                         var c = b.split("");
                         var i = 0;
                         for (var j = 0; j < b.length; j++){
                             i = a.indexOf(c[j]);
                                 if (i === -1)
                                     break;
                         }   
                         if (i !== -1){
                             return true;
                         } else {
                             return false;
                         }   
                    }       
                }