Automatic commit performed through alias...

problems/009_problem_jnotebook.ipynb

@@ -89,16 +89,9 @@
    "source": [
     "*Let's discuss a few ways to work through this, then select one to implement.*\n",
     "\n",
-    " 1. Create a 2D array in which we can place each candidate series of integers.\\\n",
+    " 1. Create \n",
-    "  A column vector can also be created in which can store the product of each series.\\\n",
-    "  If we zip these arrays together, sort on the product column, we can identify the\\\n",
-    "  the maximum product and its associate string of integers.\n",
     "<br/>\n",
     "<br/>\n",
-    " 2. Create an array (of the specified length) to store a series of integers from the input\\\n",
-    "  number. Allow this to be an array that we use to compute the a product. It will shift as we\\\n",
-    "  slide along the input number. A second array of identical dimension, plus an additional place,\\\n",
-    "  could store the largest product, and the associated list of integers.  \n",
     " "
    ]
   },
@@ -117,18 +110,18 @@
    ]
   },
   {
-   "cell_type": "markdown",
+   "cell_type": "code",
+   "execution_count": null,
    "metadata": {},
-   "source": [
+   "outputs": [],
-    "#### 1. b) Build out the candidate array. "
+   "source": []
-   ]
   },
   {
-   "cell_type": "markdown",
+   "cell_type": "code",
+   "execution_count": null,
    "metadata": {},
-   "source": [
+   "outputs": [],
-    "#### 1. c) Cheat by using pandas to print out the maximum product and its associated series of integers. "
+   "source": []
-   ]
   },
   {
    "cell_type": "code",