Bonfire Drop it

Author

Created by Rafase282

Github | FreeCodeCamp | CodePen | LinkedIn | Website | My Original Wiki

Details

• Difficulty: 2/5

Drop the elements of an array (first argument), starting from the front, until the predicate (second argument) returns true.

Remember to use RSAP if you get stuck. Try to pair program. Write your own code.

Useful Links

• Arguments object
• Array.shift()

Problem Script:

function drop(arr, func) {
  // Drop them elements.
  return arr;
}

drop([1, 2, 3], function(n) {return n < 3; });

Explanation:

Basically while the second argument is not true, you will have to remove the first element from the left of the array that was passed as the first argument.

Hint: 1

You can use Array.shift() or filter that you should be more familiar with to solve this problem in a few lines of code.

Hint: 2

Shift returns the element that was removed which we don't really need, all we need is the modified array that is left.

Hint: 3

If you still can't figure out how to solve it with shift, then try solving it with filter, and check how filter works, if you become familiar with it, then you can make the code with shift.

Code Solution:

Code from Max Helmetag (https://github.com/mhelmetag)

function drop(arr, func) {
  var times = arr.length;
  for (var i = 0; i < times; i++) {
    if (func(arr[0])) {
      break;
    } else {
      arr.shift();
    }
  }

  return arr;
}

drop([1, 2, 3], function(n) {return n < 3; });

My Code Explanation:

• Create a for loop to check each element.
• Then check for the function given if true then stop, otherwise remove that element.
• return the array.

Go Home