From 1a78750e49a1b35daafaf0a9f81a7e71a3004f71 Mon Sep 17 00:00:00 2001 From: Donne Martin Date: Tue, 30 Jun 2015 06:35:44 -0400 Subject: [PATCH] Appended _solution to current notebooks to prepare for challenge and solution notebooks. --- README.md | 26 +++++++++---------- ...rt.ipynb => insertion_sort_solution.ipynb} | 0 ...e_sort.ipynb => merge_sort_solution.ipynb} | 0 ...k_sort.ipynb => quick_sort_solution.ipynb} | 0 ...rt.ipynb => selection_sort_solution.ipynb} | 0 5 files changed, 13 insertions(+), 13 deletions(-) rename sorting_searching/insertion_sort/{insertion_sort.ipynb => insertion_sort_solution.ipynb} (100%) rename sorting_searching/merge_sort/{merge_sort.ipynb => merge_sort_solution.ipynb} (100%) rename sorting_searching/quick_sort/{quick_sort.ipynb => quick_sort_solution.ipynb} (100%) rename sorting_searching/selection_sort/{selection_sort.ipynb => selection_sort_solution.ipynb} (100%) diff --git a/README.md b/README.md index 00e5045..0e20a4a 100644 --- a/README.md +++ b/README.md @@ -56,29 +56,29 @@ Continually updated Python Notebooks containing TDD-based coding challenges and | Notebook | Problem Statement | |--------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------| -| [n_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/n_stacks/n_stacks.ipynb) | Implement n stacks using a single array | -| [stack_min](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/stack_min/stack_min.ipynb) | Implement a stack that keeps track of its minimum element | -| [set_of_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/set_of_stacks/set_of_stacks.ipynb) | Implement a set of stacks class that wraps a list of stacks, each bound by a capacity | -| [hanoi](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/hanoi/hanoi.ipynb) | Implement the Towers of Hanoi with 3 towers and N disks | -| [queue_from_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/queue_from_stacks/queue_from_stacks.ipynb) | Implement a queue using two stacks | -| [sort_stack](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/sort_stack/sort_stack.ipynb) | Sort a stack using another stack as a buffer | -| [stack](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/stack/stack.ipynb) | Implement a stack with push, pop, and peek methods using a linked list | -| [queue](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/queue_list/queue_list.ipynb) | Implement a queue with enqueue and dequeue methods using a linked list | +| [n_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/n_stacks/n_stacks_solution.ipynb) | Implement n stacks using a single array | +| [stack_min](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/stack_min/stack_min_solution.ipynb) | Implement a stack that keeps track of its minimum element | +| [set_of_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/set_of_stacks/set_of_stacks_solution.ipynb) | Implement a set of stacks class that wraps a list of stacks, each bound by a capacity | +| [hanoi](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/hanoi/hanoi_solution.ipynb) | Implement the Towers of Hanoi with 3 towers and N disks | +| [queue_from_stacks](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/queue_from_stacks/queue_from_stacks_solution.ipynb) | Implement a queue using two stacks | +| [sort_stack](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/sort_stack/sort_stack_solution.ipynb) | Sort a stack using another stack as a buffer | +| [stack](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/stack/stack_solution.ipynb) | Implement a stack with push, pop, and peek methods using a linked list | +| [queue](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/stacks_queues/queue_list/queue_list_solution.ipynb) | Implement a queue with enqueue and dequeue methods using a linked list | ## Sorting and Searching | Notebook | Problem Statement | |--------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------| -| [selection_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/selection_sort/selection_sort.ipynb#) | Implement selection sort | -| [insertion_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/insertion_sort/insertion_sort.ipynb#) | Implement insertion sort | -| [quick_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/quick_sort/quick_sort.ipynb#) | Implement quick sort | -| [merge_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/merge_sort/merge_sort.ipynb#) | Implement merge sort | +| [selection_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/selection_sort/selection_sort_solution.ipynb#) | Implement selection sort | +| [insertion_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/insertion_sort/insertion_sort_solution.ipynb#) | Implement insertion sort | +| [quick_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/quick_sort/quick_sort_solution.ipynb#) | Implement quick sort | +| [merge_sort](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/merge_sort/merge_sort_solution.ipynb#) | Implement merge sort | ## Recursion and Dynamic Programming | Notebook | Problem Statement | |--------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------| -| [fibonacci](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/recursion_dynamic/fibonacci.ipynb#) | Implement fibonacci recursively, dynamically, and iteratively | +| [fibonacci](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/recursion_dynamic/fibonacci_solution.ipynb#) | Implement fibonacci recursively, dynamically, and iteratively | ## Trees and Graphs diff --git a/sorting_searching/insertion_sort/insertion_sort.ipynb b/sorting_searching/insertion_sort/insertion_sort_solution.ipynb similarity index 100% rename from sorting_searching/insertion_sort/insertion_sort.ipynb rename to sorting_searching/insertion_sort/insertion_sort_solution.ipynb diff --git a/sorting_searching/merge_sort/merge_sort.ipynb b/sorting_searching/merge_sort/merge_sort_solution.ipynb similarity index 100% rename from sorting_searching/merge_sort/merge_sort.ipynb rename to sorting_searching/merge_sort/merge_sort_solution.ipynb diff --git a/sorting_searching/quick_sort/quick_sort.ipynb b/sorting_searching/quick_sort/quick_sort_solution.ipynb similarity index 100% rename from sorting_searching/quick_sort/quick_sort.ipynb rename to sorting_searching/quick_sort/quick_sort_solution.ipynb diff --git a/sorting_searching/selection_sort/selection_sort.ipynb b/sorting_searching/selection_sort/selection_sort_solution.ipynb similarity index 100% rename from sorting_searching/selection_sort/selection_sort.ipynb rename to sorting_searching/selection_sort/selection_sort_solution.ipynb