GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-05 00:48:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added queue challenge.

Browse Source
This commit is contained in:
Donne Martin
2015-07-02 23:05:10 -04:00
parent 861d7bd25b
commit 1d9e3ad495
5 changed files with 305 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

66
stacks_queues/queue_list/queue_list_solution.ipynb
View File

@@ -4,7 +4,14 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/coding-challenges).</i></small>"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Solution Notebook"
]
},
{
@@ -27,11 +34,13 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* If there is one item in the list, do you expect the first and last pointers to both point to it?\n",
" * Yes\n",
"* If there are no items on the list, do you expect the first and last pointers to be NULL?\n",
" * Yes\n",
"* If you dequeue on an empty queue, does that return None?\n",
" * Yes"
]
},
@@ -48,7 +57,7 @@
"\n",
"### Dequeue\n",
"\n",
"* Dequeue an empty queue\n",
"* Dequeue an empty queue -> None\n",
"* Dequeue a queue with one element\n",
"* Dequeue a queue with more than one element"
]
@@ -109,15 +118,14 @@
],
"source": [
"%%writefile queue_list.py\n",
"# Need to avoid naming this queue.py as it \n",
"# will conflict with IPython Notebook\n",
"\n",
"class Node(object):\n",
" \n",
" def __init__(self, data):\n",
" self.data = data\n",
" self.next = None\n",
"\n",
"class Queue(object):\n",
" \n",
" def __init__(self):\n",
" self.first = None\n",
" self.last = None\n",
@@ -164,8 +172,7 @@
"metadata": {},
"source": [
"## Unit Test\n",
"\n",
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
"\n"
]
},
{
@@ -179,19 +186,17 @@
"name": "stdout",
"output_type": "stream",
"text": [
"Test: Dequeue an empty queue\n",
"Test: Enqueue to an empty queue\n",
"Test: Dequeue a queue with one element\n",
"Test: Enqueue to a non-empty queue\n",
"Test: Dequeue a queue with more than one element\n",
"Success: test_end_to_end\n"
"Overwriting test_queue_list.py\n"
]
}
],
"source": [
"%%writefile test_queue_list.py\n",
"from nose.tools import assert_equal\n",
"\n",
"class Test(object):\n",
"\n",
"class TestQueue(object):\n",
" \n",
" # TODO: It would be better if we had unit tests for each\n",
" # method in addition to the following end-to-end test\n",
" def test_end_to_end(self):\n",
@@ -217,9 +222,36 @@
" \n",
" print('Success: test_end_to_end')\n",
"\n",
"def main():\n",
" test = TestQueue()\n",
" test.test_end_to_end()\n",
" \n",
"if __name__ == '__main__':\n",
" test = Test()\n",
" test.test_end_to_end()"
" main()"
]
},
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"Test: Dequeue an empty queue\n",
"Test: Enqueue to an empty queue\n",
"Test: Dequeue a queue with one element\n",
"Test: Enqueue to a non-empty queue\n",
"Test: Dequeue a queue with more than one element\n",
"Success: test_end_to_end\n"
]
}
],
"source": [
"%run -i test_queue_list.py"
]
},
{