mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-03 16:08:02 +00:00
195 lines
4.9 KiB
Python
195 lines
4.9 KiB
Python
{
|
|
"cells": [
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges)."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"# Challenge Notebook"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Problem: Delete a node in the middle, given only access to that node.\n",
|
|
"\n",
|
|
"* [Constraints](#Constraints)\n",
|
|
"* [Test Cases](#Test-Cases)\n",
|
|
"* [Algorithm](#Algorithm)\n",
|
|
"* [Code](#Code)\n",
|
|
"* [Unit Test](#Unit-Test)\n",
|
|
"* [Solution Notebook](#Solution-Notebook)"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Constraints\n",
|
|
"\n",
|
|
"* Can we assume this is a non-circular, singly linked list?\n",
|
|
" * Yes\n",
|
|
"* What if the final node is being deleted, for example a single node list? Do we make it a dummy with value None?\n",
|
|
" * Yes\n",
|
|
"* Can we assume we already have a linked list class that can be used for this problem?\n",
|
|
" * Yes"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Test Cases\n",
|
|
"\n",
|
|
"* Delete on empty list -> None\n",
|
|
"* Delete None -> None\n",
|
|
"* Delete on one node -> [None]\n",
|
|
"* Delete on multiple nodes"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Algorithm\n",
|
|
"\n",
|
|
"Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/linked_lists/delete_mid/delete_mid_solution.ipynb). If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Code"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {
|
|
"collapsed": false
|
|
},
|
|
"outputs": [],
|
|
"source": [
|
|
"%run ../linked_list/linked_list.py\n",
|
|
"%load ../linked_list/linked_list.py"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {
|
|
"collapsed": false
|
|
},
|
|
"outputs": [],
|
|
"source": [
|
|
"class MyLinkedList(LinkedList):\n",
|
|
"\n",
|
|
" def delete_node(self, node):\n",
|
|
" # TODO: Implement me\n",
|
|
" pass"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Unit Test"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"\n",
|
|
"\n",
|
|
"**The following unit test is expected to fail until you solve the challenge.**"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {
|
|
"collapsed": false
|
|
},
|
|
"outputs": [],
|
|
"source": [
|
|
"# %load test_delete_mid.py\n",
|
|
"from nose.tools import assert_equal\n",
|
|
"\n",
|
|
"\n",
|
|
"class TestDeleteNode(object):\n",
|
|
"\n",
|
|
" def test_delete_node(self):\n",
|
|
" print('Test: Empty list, null node to delete')\n",
|
|
" linked_list = MyLinkedList(None)\n",
|
|
" linked_list.delete_node(None)\n",
|
|
" assert_equal(linked_list.get_all_data(), [])\n",
|
|
"\n",
|
|
" print('Test: One node')\n",
|
|
" head = Node(2)\n",
|
|
" linked_list = MyLinkedList(head)\n",
|
|
" linked_list.delete_node(head)\n",
|
|
" assert_equal(linked_list.get_all_data(), [None])\n",
|
|
"\n",
|
|
" print('Test: Multiple nodes')\n",
|
|
" linked_list = MyLinkedList(None)\n",
|
|
" node0 = linked_list.insert_to_front(1)\n",
|
|
" node1 = linked_list.insert_to_front(3)\n",
|
|
" node2 = linked_list.insert_to_front(4)\n",
|
|
" node3 = linked_list.insert_to_front(1)\n",
|
|
" linked_list.delete_node(node2)\n",
|
|
" assert_equal(linked_list.get_all_data(), [1, 3, 1])\n",
|
|
"\n",
|
|
" print('Success: test_delete_node')\n",
|
|
"\n",
|
|
"\n",
|
|
"def main():\n",
|
|
" test = TestDeleteNode()\n",
|
|
" test.test_delete_node()\n",
|
|
"\n",
|
|
"\n",
|
|
"if __name__ == '__main__':\n",
|
|
" main()"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Solution Notebook\n",
|
|
"\n",
|
|
"Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/linked_lists/delete_mid/delete_mid_solution.ipynb) for a discussion on algorithms and code solutions."
|
|
]
|
|
}
|
|
],
|
|
"metadata": {
|
|
"kernelspec": {
|
|
"display_name": "Python 3",
|
|
"language": "python",
|
|
"name": "python3"
|
|
},
|
|
"language_info": {
|
|
"codemirror_mode": {
|
|
"name": "ipython",
|
|
"version": 3
|
|
},
|
|
"file_extension": ".py",
|
|
"mimetype": "text/x-python",
|
|
"name": "python",
|
|
"nbconvert_exporter": "python",
|
|
"pygments_lexer": "ipython3",
|
|
"version": "3.5.0"
|
|
}
|
|
},
|
|
"nbformat": 4,
|
|
"nbformat_minor": 0
|
|
}
|