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

Fix typos (#191)

Browse Source
This commit is contained in:
delirious-lettuce
2017-05-15 22:30:12 -06:00
committed by Donne Martin
parent cd9e9654bc
commit 9f89a51aba
33 changed files with 71 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graphs_trees/bst_validate/bst_validate_solution.ipynb
View File

@@ -74,7 +74,7 @@
"source": [
"## Algorithm\n",
"\n",
"We'll use a recursive solution that valides left <= current < right, passing down the min and max values as we do a depth-first traversal.\n",
"We'll use a recursive solution that validates left <= current < right, passing down the min and max values as we do a depth-first traversal.\n",
"\n",
"* If the node is None, return True\n",
"* If min is set and the node's value <= min, return False\n",
@@ -123,12 +123,12 @@
" raise TypeError('No root node')\n",
" return self._validate(self.root)\n",
"\n",
" def _validate(self, node, mininum=-sys.maxsize, maximum=sys.maxsize):\n",
" def _validate(self, node, minimum=-sys.maxsize, maximum=sys.maxsize):\n",
" if node is None:\n",
" return True\n",
" if node.data <= mininum or node.data > maximum:\n",
" if node.data <= minimum or node.data > maximum:\n",
" return False\n",
" if not self._validate(node.left, mininum, node.data):\n",
" if not self._validate(node.left, minimum, node.data):\n",
" return False\n",
" if not self._validate(node.right, node.data, maximum):\n",
" return False\n",

6
graphs_trees/graph/graph_solution.ipynb
View File

@@ -93,17 +93,17 @@
"* incoming edge count (useful for algorithms such as topological sort)\n",
"* adjacent nodes and edge weights\n",
"\n",
"#### add_neighhbor\n",
"#### add_neighbor\n",
"\n",
"* If the neighbor doesn't already exist as an adjacent node\n",
" * Update the adjancet nodes and edge weights\n",
" * Update the adjacent nodes and edge weights\n",
" * Increment the neighbor's incoming edge count\n",
"\n",
"Complexity:\n",
"* Time: O(1)\n",
"* Space: O(1)\n",
"\n",
"#### remove_neighhbor\n",
"#### remove_neighbor\n",
"\n",
"* If the neighbor exists as an adjacent node\n",
" * Decrement the neighbor's incoming edge count\n",

2
graphs_trees/graph_shortest_path/graph_shortest_path_challenge.ipynb
View File

@@ -67,7 +67,7 @@
"source": [
"## Test Cases\n",
"\n",
"The constaints state we don't have to check for negative edges, so we test with the general case.\n",
"The constraints state we don't have to check for negative edges, so we test with the general case.\n",
"\n",
"<pre>\n",
"graph.add_edge('a', 'b', weight=5)\n",

2
graphs_trees/graph_shortest_path/graph_shortest_path_solution.ipynb
View File

@@ -66,7 +66,7 @@
"source": [
"## Test Cases\n",
"\n",
"The constaints state we don't have to check for negative edges, so we test with the general case.\n",
"The constraints state we don't have to check for negative edges, so we test with the general case.\n",
"\n",
"<pre>\n",
"graph.add_edge('a', 'b', weight=5)\n",