interactive-coding-challenges/stacks-queues
2015-05-20 17:20:49 -04:00
..
hanoi.ipynb Added notebook solving the following: Implement the Towers of Hanoi with 3 towers and N disks. 2015-05-20 17:20:49 -04:00
n-stacks.ipynb Removed unused Pythonic-Code header. 2015-05-17 07:47:07 -04:00
queue-list.ipynb Rename queue files to queue_list to avoid conflicting with IPython Notebook. 2015-05-16 08:44:11 -04:00
queue-list.py Rename queue files to queue_list to avoid conflicting with IPython Notebook. 2015-05-16 08:44:11 -04:00
set-of-stacks.ipynb Tweaked problem statement for clarity. Removed unused Pythonic-Code header. 2015-05-17 07:47:51 -04:00
stack-min.ipynb Removed unused Pythonic-Code header. 2015-05-17 07:47:07 -04:00
stack.ipynb Added notebook solving the following: Implement a stack with push, pop, and peek methods using a linked list. 2015-05-15 06:08:46 -04:00
stack.py Added notebook solving the following: Implement a stack with push, pop, and peek methods using a linked list. 2015-05-15 06:08:46 -04:00