GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-03-03 22:28:46 +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
linked_lists/add_reverse/add_reverse_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",
"* Do you expect the return to be in reverse order too?\n",
" * Yes\n",
"* What if one of the inputs is None?\n",

3
linked_lists/add_reverse/add_reverse_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",
"* Do you expect the return to be in reverse order too?\n",
" * Yes\n",
"* What if one of the inputs is None?\n",

3
linked_lists/delete_mid/delete_mid_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",
"* 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",

3
linked_lists/delete_mid/delete_mid_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",
"* 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",

3
linked_lists/find_loop_start/find_loop_start_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 this a singly linked list?\n",
" * Yes\n",
"* Can we assume we are always passed a circular linked list?\n",

3
linked_lists/find_loop_start/find_loop_start_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 this a singly linked list?\n",
" * Yes\n",
"* Can we assume we are always passed a circular linked list?\n",

3
linked_lists/kth_to_last_elem/kth_to_last_elem_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",
"* Can we assume k is a valid integer?\n",
" * Yes\n",
"* If k = 0, does this return the last element?\n",

3
linked_lists/kth_to_last_elem/kth_to_last_elem_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",
"* Can we assume k is a valid integer?\n",
" * Yes\n",
"* If k = 0, does this return the last element?\n",

3
linked_lists/linked_list/linked_list_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 this a singly or doubly linked list?\n",
" * Singly\n",
"* Is this a circular list?\n",

3
linked_lists/linked_list/linked_list_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 this a singly or doubly linked list?\n",
" * Singly\n",
"* Is this a circular list?\n",

3
linked_lists/palindrome/palindrome_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 single character or number a palindrome?\n",
" * No\n",
"* Can we assume we already have a linked list class that can be used for this problem?\n",

3
linked_lists/palindrome/palindrome_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 single character or number a palindrome?\n",
" * No\n",
"* Can we assume we already have a linked list class that can be used for this problem?\n",

3
linked_lists/partition/partition_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",
"* Can we create additional data structures?\n",
" * Yes\n",
"* Do you expect the function to return a new list?\n",

3
linked_lists/partition/partition_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",
"* Can we create additional data structures?\n",
" * Yes\n",
"* Do you expect the function to return a new list?\n",

3
linked_lists/remove_duplicates/remove_duplicates_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 this a singly or doubly linked list?\n",
" * Singly\n",
"* Can you insert None values in the list?\n",

3
linked_lists/remove_duplicates/remove_duplicates_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 this a singly or doubly linked list?\n",
" * Singly\n",
"* Can you insert None values in the list?\n",