From dc5d18bbef7bfe1d942528ac901e5e437913fdad Mon Sep 17 00:00:00 2001
From: Stevan Freeborn <65925598+StevanFreeborn@users.noreply.github.com>
Date: Mon, 11 Dec 2023 02:20:35 -0600
Subject: [PATCH] docs: update README.md

---
 README.md | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/README.md b/README.md
index df65687..7ceeeee 100644
--- a/README.md
+++ b/README.md
@@ -42,18 +42,18 @@ dotnet build
 
 ## Challenges
 
-| Day | Problem                    |              Solution               | Status | Notes                                                                                                                                |
-| --- | -------------------------- | :---------------------------------: | :----: | ------------------------------------------------------------------------------------------------------------------------------------ |
-| 01  | [Problem](./01/PROBLEM.md) |     [Solution](./01/Trebuchet/)     |   ✅   | The trickiest part here was accounting for overlapping digit words.                                                                  |
-| 02  | [Problem](./02/PROBLEM.md) |   [Solution](./02/CubeConundrum/)   |   ✅   | The key to me here was to parse the input into a useful model.                                                                       |
-| 03  | [Problem](./03/PROBLEM.md) |    [Solution](./03/GearRatios/)     |   ✅   | The edge case that got me here was lines ending with a part number.                                                                  |
-| 04  | [Problem](./04/PROBLEM.md) |   [Solution](./04/Scratchcards/)    |   ✅   | Part 2 gets out of hand quickly with just 200 cards.                                                                                 |
-| 05  | [Problem](./05/PROBLEM.md) |      [Solution](./05/IYGASAF/)      |   ✅   | I brute forced part 2 using parallelism. I know shame.                                                                               |
-| 06  | [Problem](./06/PROBLEM.md) |     [Solution](./06/WaitForIt/)     |   ✅   | Thank goodness part 2 was not like 5's part 2. 😅                                                                                    |
-| 07  | [Problem](./07/PROBLEM.md) |    [Solution](./07/CamelCards/)     |   ✅   | What took me longest here was I missed a case when jokers are wild and there are three groups of cards.                              |
-| 08  | [Problem](./08/PROBLEM.md) | [Solution](./08/HauntedWasteland/)  |   ✅   | Got to implement a least common multiple algorithm for part 2.                                                                       |
-| 09  | [Problem](./09/PROBLEM.md) | [Solution](./09/MirageMaintenance/) |   ✅   | Part 1 took me unnecessarily long. The bug was summing a line to check for all zeros is bad idea when negative numbers are involved. |
-| 10  | [Problem](./10/PROBLEM.md) |          [Solution](./10/)          |   ⌛   |
+| Day | Problem                    |              Solution               | Status | Notes                                                                                                                                            |
+| --- | -------------------------- | :---------------------------------: | :----: | ------------------------------------------------------------------------------------------------------------------------------------------------ |
+| 01  | [Problem](./01/PROBLEM.md) |     [Solution](./01/Trebuchet/)     |   ✅   | The trickiest part here was accounting for overlapping digit words.                                                                              |
+| 02  | [Problem](./02/PROBLEM.md) |   [Solution](./02/CubeConundrum/)   |   ✅   | The key to me here was to parse the input into a useful model.                                                                                   |
+| 03  | [Problem](./03/PROBLEM.md) |    [Solution](./03/GearRatios/)     |   ✅   | The edge case that got me here was lines ending with a part number.                                                                              |
+| 04  | [Problem](./04/PROBLEM.md) |   [Solution](./04/Scratchcards/)    |   ✅   | Part 2 gets out of hand quickly with just 200 cards.                                                                                             |
+| 05  | [Problem](./05/PROBLEM.md) |      [Solution](./05/IYGASAF/)      |   ✅   | I brute forced part 2 using parallelism. I know shame.                                                                                           |
+| 06  | [Problem](./06/PROBLEM.md) |     [Solution](./06/WaitForIt/)     |   ✅   | Thank goodness part 2 was not like 5's part 2. 😅                                                                                                |
+| 07  | [Problem](./07/PROBLEM.md) |    [Solution](./07/CamelCards/)     |   ✅   | What took me longest here was I missed a case when jokers are wild and there are three groups of cards.                                          |
+| 08  | [Problem](./08/PROBLEM.md) | [Solution](./08/HauntedWasteland/)  |   ✅   | Got to implement a least common multiple algorithm for part 2.                                                                                   |
+| 09  | [Problem](./09/PROBLEM.md) | [Solution](./09/MirageMaintenance/) |   ✅   | Part 1 took me unnecessarily long. The bug was summing a line to check for all zeros is bad idea when negative numbers are involved.             |
+| 10  | [Problem](./10/PROBLEM.md) |     [Solution](./10/PipeMaze/)      |   ✅   | So...my solutions are rather slow, but they work. Part 2 appears to have a mathematical solution, but scanning is what I came up with on my own. |
 | 11  | [Problem](./11/PROBLEM.md) |          [Solution](./11/)          |   ⌛   |
 | 12  | [Problem](./12/PROBLEM.md) |          [Solution](./12/)          |   ⌛   |
 | 13  | [Problem](./13/PROBLEM.md) |          [Solution](./13/)          |   ⌛   |