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

Tweaked constraints section discussion.

Browse Source
This commit is contained in:
Donne Martin
2015-07-06 06:03:09 -04:00
parent d236679338
commit fac7bbb1be
60 changed files with 60 additions and 120 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
sorting_searching/insertion_sort/insertion_sort_challenge.ipynb
View File

@@ -34,8 +34,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]

3
sorting_searching/insertion_sort/insertion_sort_solution.ipynb
View File

@@ -33,8 +33,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]

3
sorting_searching/merge_sort/merge_sort_challenge.ipynb
View File

@@ -34,8 +34,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]

3
sorting_searching/merge_sort/merge_sort_solution.ipynb
View File

@@ -33,8 +33,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]

3
sorting_searching/quick_sort/quick_sort_challenge.ipynb
View File

@@ -34,8 +34,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient (ie not in-place)?\n",
" * Yes"
]

3
sorting_searching/quick_sort/quick_sort_solution.ipynb
View File

@@ -34,8 +34,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient (ie not in-place)?\n",
" * Yes"
]

3
sorting_searching/selection_sort/selection_sort_challenge.ipynb
View File

@@ -34,8 +34,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n",
" * Yes"
]

3
sorting_searching/selection_sort/selection_sort_solution.ipynb
View File

@@ -33,8 +33,7 @@
"source": [
"## Constraints\n",
"\n",
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n",
"* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n",
" * Yes"
]