about summary refs log tree commit diff
path: root/scratch/deepmind/part_two
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-02-19T16·02+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-02-19T16·02+0000
commit737bdd0a230b034d5dbd1c288902a9650ac3bd95 (patch)
tree88d9efd4f2e86d52ad55476a126a0a7a3a3a3949 /scratch/deepmind/part_two
parent00e3526d9a41ca2390863b5666c6faebc9b707c3 (diff)
Solve InterviewCake's merge sorted arrays question
Write a function merging two sorted arrays into one sorted array.
Diffstat (limited to 'scratch/deepmind/part_two')
-rw-r--r--scratch/deepmind/part_two/merge-sorted-arrays.ts63
-rw-r--r--scratch/deepmind/part_two/todo.org2
2 files changed, 64 insertions, 1 deletions
diff --git a/scratch/deepmind/part_two/merge-sorted-arrays.ts b/scratch/deepmind/part_two/merge-sorted-arrays.ts
new file mode 100644
index 000000000000..2d478e0e37de
--- /dev/null
+++ b/scratch/deepmind/part_two/merge-sorted-arrays.ts
@@ -0,0 +1,63 @@
+function mergeArrays(xs: Array<number>, ys: Array<number>): Array<number> {
+  let i = 0;
+  let j = 0;
+  const result = [];
+
+  for (let q = 0; q < xs.length + ys.length; q += 1) {
+    if (i === xs.length) {
+      while (j < ys.length) {
+        result.push(ys[j]);
+        j += 1;
+      }
+    } else if (j === ys.length) {
+      while (i < xs.length) {
+        result.push(xs[i]);
+        i += 1;
+      }
+    } else if (xs[i] < ys[j]) {
+      result.push(xs[i]);
+      i += 1;
+    } else {
+      result.push(ys[j]);
+      j += 1;
+    }
+  }
+
+  return result;
+}
+
+// Tests
+let desc = "both arrays are empty";
+let actual = mergeArrays([], []);
+let expected = [];
+assertDeepEqual(actual, expected, desc);
+
+desc = "first array is empty";
+actual = mergeArrays([], [1, 2, 3]);
+expected = [1, 2, 3];
+assertDeepEqual(actual, expected, desc);
+
+desc = "second array is empty";
+actual = mergeArrays([5, 6, 7], []);
+expected = [5, 6, 7];
+assertDeepEqual(actual, expected, desc);
+
+desc = "both arrays have some numbers";
+actual = mergeArrays([2, 4, 6], [1, 3, 7]);
+expected = [1, 2, 3, 4, 6, 7];
+assertDeepEqual(actual, expected, desc);
+
+desc = "arrays are different lengths";
+actual = mergeArrays([2, 4, 6, 8], [1, 7]);
+expected = [1, 2, 4, 6, 7, 8];
+assertDeepEqual(actual, expected, desc);
+
+function assertDeepEqual(a: Array<number>, b: Array<number>, desc: string) {
+  const aStr = JSON.stringify(a);
+  const bStr = JSON.stringify(b);
+  if (aStr !== bStr) {
+    console.log(`${desc} ... FAIL: ${aStr} != ${bStr}`);
+  } else {
+    console.log(`${desc} ... PASS`);
+  }
+}
diff --git a/scratch/deepmind/part_two/todo.org b/scratch/deepmind/part_two/todo.org
index 91fd3fbf2c1c..8e23a6d5b985 100644
--- a/scratch/deepmind/part_two/todo.org
+++ b/scratch/deepmind/part_two/todo.org
@@ -2,7 +2,7 @@
 ** DONE Merging Meeting Times
 ** DONE Reverse String in Place
 ** DONE Reverse Words
-** TODO Merge Sorted Arrays
+** DONE Merge Sorted Arrays
 ** TODO Cafe Order Checker
 * Hashing and hash tables
 ** TODO Inflight Entertainment