X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=problem-ideas.ipynb;fp=problem-ideas.ipynb;h=c595a69c5ae91534b9092e19900763b0ddb35ae0;hb=aa80b7819bf4c4a936005d9f383965459bcea25c;hp=1b09937a47397f54dd90b671efc5db1bb0cc52d7;hpb=84f4f6adf2ce92396c17e13d1d5538e34a224769;p=ou-summer-of-code-2017.git

diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb
index 1b09937..c595a69 100644
--- a/problem-ideas.ipynb
+++ b/problem-ideas.ipynb
@@ -4,7 +4,21 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "# Project ideas"
+    "# Project ideas\n",
+    "\n",
+    "[Project workspace](https://learn2.open.ac.uk/course/view.php?id=206050)\n"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "## Longest substring of _k_ distinct characters\n",
+    "Given a string of letters, what is the longest (contiguous) substring with no more than _k_ distinct characters?\n",
+    "\n",
+    "Could also do it with words instead of letters. \n",
+    "\n",
+    "Not sure how to find the extension..."
    ]
   },
   {
@@ -33,7 +47,10 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "## Wordsearch: \n",
+    "## [Wordsearch](wordsearch/): \n",
+    "\n",
+    "Wordsearch [creation](wordsearch/wordsearch-creation.ipynb) and [solving](wordsearch/wordsearch-solving.ipynb).\n",
+    "\n",
     "Given a grid of letters and a list of words, how many words are in the grid?\n",
     "\n",
     "Extension: what's the longest word you can make from the leftover letters?"
@@ -256,7 +273,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.5.2"
+   "version": "3.5.2+"
   }
  },
  "nbformat": 4,