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

Update graphs challenges to add connected constraint (#151)

Browse Source
This commit is contained in:
Donne Martin
2017-03-13 05:24:32 -04:00
committed by GitHub
parent 7884146d54
commit a37e08d8d4
8 changed files with 24 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs_trees/graph/graph_challenge.ipynb
View File

@@ -44,6 +44,8 @@
" * Yes\n", " * Yes\n",
"* If we try to delete a node that doesn't exist, do we just do nothing?\n", "* If we try to delete a node that doesn't exist, do we just do nothing?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -278,7 +280,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph/graph_solution.ipynb
View File

@@ -43,6 +43,8 @@
" * Yes\n", " * Yes\n",
"* If we try to delete a node that doesn't exist, do we just do nothing?\n", "* If we try to delete a node that doesn't exist, do we just do nothing?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -383,7 +385,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_bfs/bfs_challenge.ipynb
View File

@@ -38,6 +38,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -206,7 +208,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_bfs/bfs_solution.ipynb
View File

@@ -37,6 +37,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -244,7 +246,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_dfs/dfs_challenge.ipynb
View File

@@ -38,6 +38,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -207,7 +209,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_dfs/dfs_solution.ipynb
View File

@@ -37,6 +37,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -229,7 +231,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_path_exists/path_exists_challenge.ipynb
View File

@@ -38,6 +38,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -197,7 +199,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,

4
graphs_trees/graph_path_exists/path_exists_solution.ipynb
View File

@@ -37,6 +37,8 @@
" * Yes\n", " * Yes\n",
"* Can we assume we already have Graph and Node classes?\n", "* Can we assume we already have Graph and Node classes?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this is a connected graph?\n",
" * Yes\n",
"* Can we assume the inputs are valid?\n", "* Can we assume the inputs are valid?\n",
" * Yes\n", " * Yes\n",
"* Can we assume this fits memory?\n", "* Can we assume this fits memory?\n",
@@ -240,7 +242,7 @@
"name": "python", "name": "python",
"nbconvert_exporter": "python", "nbconvert_exporter": "python",
"pygments_lexer": "ipython3", "pygments_lexer": "ipython3",
"version": "3.5.0" "version": "3.4.3"
} }
}, },
"nbformat": 4, "nbformat": 4,