Added notebook solving the following: Implement SetOfStacks that wraps a list of stacks, where each stack is bound by a capacity.

This commit is contained in:
Donne Martin
2015-05-17 07:41:32 -04:00
parent 013ac4c1ec
commit a5d58e2728
2 changed files with 192 additions and 0 deletions

View File

@@ -34,6 +34,7 @@ Continually updated IPython Notebooks containing coding problems and solutions (
* [Implement a queue with enqueue and dequeue methods using a linked list](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/stacks-queues/queue.ipynb)
* [Implement n stacks using a single array](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/stacks-queues/n-stacks.ipynb)
* [Implement a stack that keeps track of its minimum element](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/stacks-queues/stack-min.ipynb)
* [Implement SetOfStacks that wraps a list of stacks, each bound by a capacity](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/stacks-queues/set-of-stacks.ipynb)
## License