Add initial implementation of the "Merge Sorted Array" problem in TypeScript, including in-place modification of nums1 and a sorting algorithm. Status and time taken comments included for reference.

Author: argondev22

src/leetcode/88_merge-sorted-array/20251023.ts

@@ -0,0 +1,19 @@
+/**
+ Do not return anything, modify nums1 in-place instead.
+ */
+ export function merge(nums1: number[], m: number, nums2: number[], n: number): void {
+    for (let i = 0; i < n; i++) {
+        nums1[m + i] = nums2[i];
+    }
+
+    for (let i = 0; i < m + n; i++) {
+        for (let j = 0; j < m + n; j++) {
+            const preElement = nums1[j];
+            const postElement = nums1[j + 1];
+            if (preElement > postElement) {
+                nums1[j] = postElement;
+                nums1[j + 1] = preElement;
+            }
+        }
+    }
+};