Added notebook solving the following: Find the start of a linked list loop.

This commit is contained in:
Donne Martin
2015-05-18 14:26:50 -04:00
parent db47e1bcaa
commit e5d7fbfe0f
2 changed files with 178 additions and 0 deletions

View File

@@ -27,6 +27,7 @@ Continually updated IPython Notebooks containing coding problems and solutions (
* [Delete a node in the middle of a linked list, given access to only that node](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/delete-mid.ipynb)
* [Partition a linked list around a given value](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/partition.ipynb)
* [Add two numbers whose digits are stored in a linked list in reverse order](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/add-reverse.ipynb)
* [Find the start of a linked list loop](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/find-loop-start.ipynb)
## Stacks and Queues