init

README.md

@@ -1,23 +1,23 @@
-# Algorithms
+# Algorithms\*
 
 Each directory contains a separate problem that you'll be tasked with solving.
 Inside each directory, you'll find instructions for that problem, along with a
-test file as well as an empty skeleton file. 
+test file as well as an empty skeleton file.
 
 There isn't an official prescribed order for tackling the problems, though a
 subjective ranking of the given problems from easiest to hardest might go
 something like this:
 
- 1. `stock_prices`
- 2. `recipe_batches`
- 3. `eating_cookies`
- 4. `rock_paper_scissors`
- 5. `making_change`
- 6. [Stretch Problem] `knapsack`
+1.  `stock_prices`
+2.  `recipe_batches`
+3.  `eating_cookies`
+4.  `rock_paper_scissors`
+5.  `making_change`
+6.  [Stretch Problem] `knapsack`
 
 For each problem, `cd` into the directory, read the instructions for the
 problem, implement your solution in the skeleton file, then test it using the
-provided test file. 
+provided test file.
 
 The later problems definitely get progressively more difficult, especially when
 it comes to deriving a more performant solution. Don't feel bad if you aren't