From a2a5a62836aa8cc629b7ba07bd125fabd6520cb2 Mon Sep 17 00:00:00 2001 From: William Carroll Date: Fri, 13 Mar 2020 16:51:38 +0000 Subject: 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." --- scratch/deepmind/part_two/todo.org | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'scratch/deepmind/part_two/todo.org') 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 -- cgit 1.4.1