refactor: improves performance removeAt

Author: Kevin Hermawan

README.md

@@ -129,7 +129,7 @@ console.log(result); // [1, 2, 3, 5]
 
 > **Time complexity:**
 >
-> O(n), where n is the length of the array.
+> O(n), where n is the remainder of skipped element.
 >
 > O(1), if `index` is the last index of the array.
 

src/removeAt.ts

@@ -4,19 +4,24 @@ type RemoveAtArgs = {
 
 export function removeAt<T>(array: T[], args: RemoveAtArgs) {
   const { index } = args;
-  const lastIndex = array.length - 1;
 
-  if (index > lastIndex) {
-    return array;
+  if (index === array.length - 1) {
+    const result = array.slice();
+    result.pop();
+
+    return result;
   }
 
-  const result: T[] = [];
+  if (index < array.length - 1) {
+    const result = array.slice(0, index + 1);
+    result.pop();
 
-  for (let i = 0; i < array.length; i++) {
-    if (index !== i) {
-      result.push(array[i]);
+    for (let i = 1; i < array.length - index; i++) {
+      result.push(array[index + i]);
     }
+
+    return result;
   }
 
-  return result;
+  return array;
 }