about summary refs log tree commit diff
path: root/scratch
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-03-13T16·51+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-03-13T16·51+0000
commita2a5a62836aa8cc629b7ba07bd125fabd6520cb2 (patch)
treedea23249b946379214e8e08ddacd1000924f38a1 /scratch
parent2695eae15da2df407f6c111af0930b4bcd9c5515 (diff)
Solve InterviewCake's top-scores problem
Write a function to sort a list of scores for a game in linear time. While I had
previously solved this in python, I hadn't marked the todo.org file, so I ended
up doing this again.

"Perfect practice makes perfect."
Diffstat (limited to 'scratch')
-rw-r--r--scratch/deepmind/part_two/todo.org2
-rw-r--r--scratch/deepmind/part_two/top-scores.ts58
2 files changed, 59 insertions, 1 deletions
diff --git a/scratch/deepmind/part_two/todo.org b/scratch/deepmind/part_two/todo.org
index aeb890de5579..5506b6e96b76 100644
--- a/scratch/deepmind/part_two/todo.org
+++ b/scratch/deepmind/part_two/todo.org
@@ -18,7 +18,7 @@
 * Sorting, searching, and logarithms
 ** DONE Find Rotation Point
 ** TODO Find Repeat, Space Edition
-** TODO Top Scores
+** DONE Top Scores
 ** TODO Merging Meeting Times
 * Trees and graphs
 ** TODO Balanced Binary Tree
diff --git a/scratch/deepmind/part_two/top-scores.ts b/scratch/deepmind/part_two/top-scores.ts
new file mode 100644
index 000000000000..ffed9ae59bc5
--- /dev/null
+++ b/scratch/deepmind/part_two/top-scores.ts
@@ -0,0 +1,58 @@
+function sortScores(xs: Array<number>, highest: number): Array<number> {
+  const counts: Array<number> = [];
+  const result: Array<number> = [];
+
+  // Initialize counts
+  for (let i = 0; i <= highest; i += 1) {
+    counts.push(0);
+  }
+
+  for (let i = 0; i < xs.length; i += 1) {
+    counts[xs[i]] += 1
+  }
+
+  for (let i = highest; i >= 0; i -= 1) {
+    let count: number = counts[i];
+
+    for (let j = 0; j < count; j += 1) {
+      result.push(i);
+    }
+  }
+
+  return result;
+}
+
+
+// Tests
+let desc = 'no scores';
+let actual = sortScores([], 100);
+let expected = [];
+assertEqual(JSON.stringify(actual), JSON.stringify(expected), desc);
+
+desc = 'one score';
+actual = sortScores([55], 100);
+expected = [55];
+assertEqual(JSON.stringify(actual), JSON.stringify(expected), desc);
+
+desc = 'two scores';
+actual = sortScores([30, 60], 100);
+expected = [60, 30];
+assertEqual(JSON.stringify(actual), JSON.stringify(expected), desc);
+
+desc = 'many scores';
+actual = sortScores([37, 89, 41, 65, 91, 53], 100);
+expected = [91, 89, 65, 53, 41, 37];
+assertEqual(JSON.stringify(actual), JSON.stringify(expected), desc);
+
+desc = 'repeated scores';
+actual = sortScores([20, 10, 30, 30, 10, 20], 100);
+expected = [30, 30, 20, 20, 10, 10];
+assertEqual(JSON.stringify(actual), JSON.stringify(expected), desc);
+
+function assertEqual(a, b, desc) {
+  if (a === b) {
+    console.log(`${desc} ... PASS`);
+  } else {
+    console.log(`${desc} ... FAIL: ${a} != ${b}`);
+  }
+}