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

Update formatting and whitespace in a few challenges (#142)

Browse Source
This commit is contained in:
Donne Martin
2017-01-26 04:55:45 -05:00
committed by GitHub
parent 451ff2166a
commit 098aaf196d
4 changed files with 8 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graphs_trees/bst_min/bst_min_solution.ipynb
View File

@@ -93,7 +93,7 @@
}, },
{ {
"cell_type": "code", "cell_type": "code",
"execution_count": 2, "execution_count": 1,
"metadata": { "metadata": {
"collapsed": false "collapsed": false
}, },
@@ -107,15 +107,15 @@
" def create_min_bst(self, array):\n", " def create_min_bst(self, array):\n",
" if array is None:\n", " if array is None:\n",
" return\n", " return\n",
" return self._create_min_bst(array, 0, len(array)-1)\n", " return self._create_min_bst(array, 0, len(array) - 1)\n",
"\n", "\n",
" def _create_min_bst(self, array, start, end):\n", " def _create_min_bst(self, array, start, end):\n",
" if end < start:\n", " if end < start:\n",
" return None\n", " return None\n",
" mid = (start + end) // 2\n", " mid = (start + end) // 2\n",
" node = Node(array[mid])\n", " node = Node(array[mid])\n",
" node.left = self._create_min_bst(array, start, mid-1)\n", " node.left = self._create_min_bst(array, start, mid - 1)\n",
" node.right = self._create_min_bst(array, mid+1, end)\n", " node.right = self._create_min_bst(array, mid + 1, end)\n",
" return node" " return node"
] ]
}, },

1
graphs_trees/graph/graph_challenge.ipynb
View File

@@ -106,6 +106,7 @@
"\n", "\n",
"\n", "\n",
"class State(Enum):\n", "class State(Enum):\n",
"\n",
" unvisited = 0\n", " unvisited = 0\n",
" visiting = 1\n", " visiting = 1\n",
" visited = 2\n", " visited = 2\n",

1
graphs_trees/graph/graph_solution.ipynb
View File

@@ -170,6 +170,7 @@
"\n", "\n",
"\n", "\n",
"class State(Enum):\n", "class State(Enum):\n",
"\n",
" unvisited = 0\n", " unvisited = 0\n",
" visiting = 1\n", " visiting = 1\n",
" visited = 2\n", " visited = 2\n",

4
recursion_dynamic/hanoi/hanoi_solution.ipynb
View File

@@ -62,9 +62,9 @@
"* Create three stacks to represent each tower\n", "* Create three stacks to represent each tower\n",
"* def hanoi(n, src, dest, buffer):\n", "* def hanoi(n, src, dest, buffer):\n",
" * If 0 disks return\n", " * If 0 disks return\n",
" * hanoi(n-1, src, buffer)\n", " * hanoi(n-1, src, buffer, dest)\n",
" * Move remaining element from src to dest\n", " * Move remaining element from src to dest\n",
" * hanoi(n-1, buffer, dest) \n", " * hanoi(n-1, buffer, dest, src)\n",
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(2^n)\n", "* Time: O(2^n)\n",