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

diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb
index 1b09937..a4fe4ab 100644
--- a/problem-ideas.ipynb
+++ b/problem-ideas.ipynb
@@ -4,7 +4,43 @@
    "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": [
+    "## Problems by day\n",
+    "\n",
+    "1. [Ticket prices](01-ticket-prices)\n",
+    "2. [Lift instructions](02-lifts)\n",
+    "3. [Door codes](03-door-codes)\n",
+    "4. [Ghost leg, follow and pack](04-08-amidakuji)\n",
+    "5. [Display board](05-display-board)\n",
+    "6. [Tour shapes](06-tour-shapes) [Problem B](https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/problems/Problems2017.pdf): A is check if string is a closed loop, B is finding if two partial loops make a whole one\n",
+    "7. [Virtual machine](07-interpreter)\n",
+    "8. [Ghost leg, simplify](04-08-amidakuji)\n",
+    "9. [Word chains](09-word-chains)\n",
+    "10. [Word search](10-word-search)\n",
+    "\n",
+    "### Extras\n",
+    "* [Suitcase packing](10-suitacase-packing)\n",
+    "9. [Filling the days](08-filling-days) [Problem C](https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/problems/Problems2017.pdf): A per the problem, B when there are multiple rooms available\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 +69,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?"
@@ -213,6 +252,8 @@
    "metadata": {},
    "source": [
     "# More problems:\n",
+    "* [Advent of Code 2015](http://adventofcode.com/2015)\n",
+    "* [Advent of Code 2016](http://adventofcode.com/2016)\n",
     "* https://books.google.co.uk/books?id=85NsAHJjTJ0C&pg=PA390&lpg=PA390&dq=phone+number+problem+programming+names&source=bl&ots=c7oC9JvpZz&sig=aNnW6t_nmGK7SyAKchK0MaxqbkA&hl=en&sa=X&ved=0ahUKEwjnzcbbgs7RAhWKKcAKHQiFCDAQ6AEIJDAC#v=onepage&q=phone%20number%20problem%20programming%20names&f=false\n",
     "* https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/\n",
     "* https://www.reddit.com/r/dailyprogrammer/"
@@ -230,6 +271,33 @@
     "* https://www.cs.utexas.edu/users/mckinley/305j/pair-hcs-2006.pdf"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {
+    "collapsed": true
+   },
+   "source": [
+    "Polyglot challenge languages\n",
+    "\n",
+    "- Python\n",
+    "- Ruby\n",
+    "- Haskell\n",
+    "- Lisp\n",
+    "- Prolog\n",
+    "- Ada\n",
+    "- C\n",
+    "- Brainfuck\n",
+    "- Whitespace\n",
+    "- x64 assembler\n",
+    "- Smalltalk\n",
+    "- Scala\n",
+    "- Clojure\n",
+    "- Lua\n",
+    "- JavaScript\n",
+    "- Java\n",
+    "- Dart"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,
@@ -256,7 +324,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.5.2"
+   "version": "3.5.2+"
   }
  },
  "nbformat": 4,