Complete drop it algorithm

Author: ahcode0919

src/fcc-intermediate-algorithms/drop_it.js

@@ -0,0 +1,7 @@
+export function dropElements(arr, func) {
+  const element = arr.find(func);
+  if (element === undefined) {
+    return [];
+  }
+  return arr.slice(arr.indexOf(element));
+}

src/fcc-intermediate-algorithms/fcc-intermediate-algorithms.md

@@ -18,6 +18,7 @@ From the Freecodecamp Javascript Certification Intermediate Algorithms module
 - [Sum All Odd Fibonacci Numbers](#sum-all-odd-ficonacci-numbers)
 - [Sum All Primes](#sum-all-primes)
 - [Smallest Common Multiple](#smallest-common-multiple)
+- [Drop It](#drop-it)
 
 #### Sum All Numbers In a Range
 
@@ -336,3 +337,19 @@ export function smallestCommons(arr) {
     }
 }
 ```
+
+#### Drop It
+
+Given the array `arr`, iterate through and remove each element starting from the first element (the 0 index) until the function `func` returns `true` when the iterated element is passed through it.
+
+Then return the rest of the array once the condition is satisfied, otherwise, arr should be returned as an empty array.
+
+```javascript
+export function dropElements(arr, func) {
+  const element = arr.find(func);
+  if (element === undefined) {
+    return [];
+  }
+  return arr.slice(arr.indexOf(element));
+}
+```

tests/fcc-intermediate-algorithms/drop_it.test.js

@@ -0,0 +1,8 @@
+import { dropElements } from "../../src/fcc-intermediate-algorithms/drop_it";
+
+test('should remove elements that do not satisfy the function', () => {
+  expect(dropElements([1, 2, 3, 4], (n) => n >= 3)).toEqual([3, 4]);
+  expect(dropElements([1, 2, 3, 7, 4], (n) => n > 3)).toEqual([7, 4]);
+  expect(dropElements([0, 1, 0, 1], (n) => n === 1)).toEqual([1, 0, 1]);
+  expect(dropElements([1, 2, 3, 4], (n) => n > 5)).toEqual([]);
+});