Tweaked constraints section discussion.

stacks_queues/hanoi/hanoi_challenge.ipynb

@@ -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 we already have a stack class that can be used for this problem?\n",
     "    * Yes"
    ]

stacks_queues/hanoi/hanoi_solution.ipynb

@@ -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 we already have a stack class that can be used for this problem?\n",
     "    * Yes"
    ]

stacks_queues/n_stacks/n_stacks_challenge.ipynb

@@ -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",
+
     "* Are the stacks and array a fixed size?\n",
     "    * Yes"
    ]

stacks_queues/n_stacks/n_stacks_solution.ipynb

@@ -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",
+
     "* Are the stacks and array a fixed size?\n",
     "    * Yes"
    ]

stacks_queues/queue_from_stacks/queue_from_stacks_challenge.ipynb

@@ -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 methods to be enqueue and dequeue?\n",
     "    * Yes\n",
     "* Can we assume we already have a stack class that can be used for this problem?\n",

stacks_queues/queue_from_stacks/queue_from_stacks_solution.ipynb

@@ -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 methods to be enqueue and dequeue?\n",
     "    * Yes\n",
     "* Can we assume we already have a stack class that can be used for this problem?\n",

stacks_queues/queue_list/queue_list_challenge.ipynb

@@ -35,8 +35,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",
+
     "* If there is one item in the list, do you expect the first and last pointers to both point to it?\n",
     "    * Yes\n",
     "* If there are no items on the list, do you expect the first and last pointers to be None?\n",

stacks_queues/queue_list/queue_list_solution.ipynb

@@ -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",
+
     "* If there is one item in the list, do you expect the first and last pointers to both point to it?\n",
     "    * Yes\n",
     "* If there are no items on the list, do you expect the first and last pointers to be None?\n",

stacks_queues/set_of_stacks/set_of_stacks_challenge.ipynb

@@ -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 we already have a stack class that can be used for this problem?\n",
     "    * Yes\n",
     "* If a stack becomes full, we should automatically create one?\n",

stacks_queues/set_of_stacks/set_of_stacks_solution.ipynb

@@ -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 we already have a stack class that can be used for this problem?\n",
     "    * Yes\n",
     "* If a stack becomes full, we should automatically create one?\n",

stacks_queues/sort_stack/sort_stack_challenge.ipynb

@@ -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",
+
     "* When sorted, should the largest element be at the top or bottom?\n",
     "    * Top\n",
     "* Can you have duplicate values like 5, 5?\n",

stacks_queues/sort_stack/sort_stack_solution.ipynb

@@ -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",
+
     "* When sorted, should the largest element be at the top or bottom?\n",
     "    * Top\n",
     "* Can you have duplicate values like 5, 5?\n",

stacks_queues/stack/stack_challenge.ipynb

@@ -35,8 +35,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",
+
     "* None"
    ]
   },

stacks_queues/stack/stack_solution.ipynb

@@ -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",
+
     "* None"
    ]
   },

stacks_queues/stack_min/stack_min_challenge.ipynb

@@ -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 this is a stack of ints?\n",
     "    * Yes\n",
     "* If we call this function on an empty stack, can we return max int?\n",

stacks_queues/stack_min/stack_min_solution.ipynb

@@ -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 this is a stack of ints?\n",
     "    * Yes\n",
     "* If we call this function on an empty stack, can we return max int?\n",