diff --git a/Algorithm-Drop-It.md b/Algorithm-Drop-It.md
new file mode 100644
index 0000000..dbe4c1a
--- /dev/null
+++ b/Algorithm-Drop-It.md
@@ -0,0 +1,78 @@
+![](http://i.imgur.com/goyTFy2.png)
+
+# 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.prototype.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.
+
+## Spoiler Alert!
+[![687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif](https://files.gitter.im/FreeCodeCamp/Wiki/nlOm/thumb/687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif)](https://files.gitter.im/FreeCodeCamp/Wiki/nlOm/687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif)
+
+**Solution ahead!**
+
+## Code Solution 1:
+
+```js
+function drop(arr, func) {
+  // Drop them elements.
+  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; });
+```
+
+# 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.
+
+## Code Solution 2:
+
+```js
+function drop(arr, func) {
+  return arr.slice(arr.findIndex(func) >= 0 ? arr.findIndex(func): arr.length, arr.length);
+}
+
+drop([1, 2, 3, 4], function(n) {return n >= 3;});
+```
+
+# Code Explanation:
+- Use ES6 `findIndex()` function to  find the index of the element that passes the condition
+- Slice the array from the found index until the end
+- There is one edge case! if the condition is not met against any of the elements 'findIndex' will return `-1` which messes up the input to `slice()`. In this case use a simple conditional operator to return `false` instead of `-1`. And the ternary operator (?:) returns the found index of required elements when the condition is `true`, and the length of the array otherwise so that the return value is an empty array as is instructed. For more info see [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Conditional_Operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Conditional_Operator)
+
+## Code Solution 3:
+
+```js
+function drop(arr, func) {
+  while(arr.length > 0 && !func(arr[0])) {
+    arr.shift();
+  }
+  return arr;
+}
+
+drop([1, 2, 3], function(n) {return n < 3; });
+```
+
+# Code Explanation
+- Use a while loop with `Array.prototype.shift()` to continue checking and dropping the first element of the array until the function returns true. It also makes sure the array is not empty first to avoid infinite loops.
+- Return the filtered array.
+
+# Credits:
+If you found this page useful, you can give thanks by copying and pasting this on the main chat: **`Thanks @Rafase282 @sabahang for your help with Algorithm: Drop it`**
+
+> **NOTE:** Please add your username only if you have added any **relevant main contents** to the wiki page. (Please don't remove any existing usernames.)
diff --git a/Algorithm-Drop-it.md b/Algorithm-Drop-it.md
deleted file mode 100644
index 7169c86..0000000
--- a/Algorithm-Drop-it.md
+++ /dev/null
@@ -1,78 +0,0 @@
-![](http://i.imgur.com/goyTFy2.png)
-
-# 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.prototype.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.
-
-## Spoiler Alert!
-[![687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif](https://files.gitter.im/FreeCodeCamp/Wiki/nlOm/thumb/687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif)](https://files.gitter.im/FreeCodeCamp/Wiki/nlOm/687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif)
-
-**Solution ahead!**
-
-## Code Solution 1:
-
-```js
-function drop(arr, func) {
-  // Drop them elements.
-  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; });
-```
-
-# 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.
-
-## Code Solution 2:
-
-```js
-function drop(arr, func) {
-  return arr.slice(arr.findIndex(func) >= 0 ? arr.findIndex(func): arr.length, arr.length);
-}
-
-drop([1, 2, 3, 4], function(n) {return n >= 3;});
-```
-
-# Code Explanation:
-- Use ES6 `findIndex()` function to  find the index of the element that passes the condition
-- Slice the array from the found index until the end
-- There is one edge case! if the condition is not met against any of the elements 'findIndex' will return `-1` which messes up the input to `slice()`. In this case use a simple conditional operator to return `false` instead of `-1`. And the ternary operator (?:) returns the found index of required elements when the condition is `true`, and the length of the array otherwise so that the return value is an empty array as is instructed. For more info see [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Conditional_Operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Conditional_Operator)
-
-## Code Solution 3:
-
-```js
-function drop(arr, func) {
-  while(arr.length > 0 && !func(arr[0]))
-    arr.shift();
-  }
-  return arr;
-}
-
-drop([1, 2, 3], function(n) {return n < 3; });
-```
-
-# Code Explanation
-- Use a while loop with `Array.prototype.shift()` to continue checking and dropping the first element of the array until the function returns true. It also makes sure the array is not empty first to avoid infinite loops.
-- Return the filtered array.
-
-# Credits:
-If you found this page useful, you can give thanks by copying and pasting this on the main chat: **`Thanks @Rafase282 @sabahang for your help with Algorithm: Drop it`**
-
-> **NOTE:** Please add your username only if you have added any **relevant main contents** to the wiki page. (Please don't remove any existing usernames.)
