Initial commit

3 files changed, 17 insertions, 0 deletions

diff --git a/2015/11/input b/2015/11/input
new file mode 100644
index 0000000..a45c477
--- /dev/null
+++ b/2015/11/input
@@ -0,0 +1 @@
+hepxcrrq
diff --git a/2015/11/puzzle-1 b/2015/11/puzzle-1
new file mode 100644
index 0000000..b0e5756
--- /dev/null
+++ b/2015/11/puzzle-1
@@ -0,0 +1,7 @@
+The starting string is "hepxcrrq"
+
+The string must contain two sets of non-overlapping duplicates, this is best done as having the last
+5 characters be "xxyzz". The first 3 characters aren't illegal, so we don't need to change them.
+This gives an end result of "hepxxyzz".
+
+QED. (I hope)
diff --git a/2015/11/puzzle-2 b/2015/11/puzzle-2
new file mode 100644
index 0000000..444ce35
--- /dev/null
+++ b/2015/11/puzzle-2
@@ -0,0 +1,9 @@
+This continues from the last puzzle, so our starting string is "hepxxyzz"
+
+Following the theme of the previous puzzle, we want to create an "xxyzz" pattern in the lowest
+amount of increments possible. Since the string currently ends in "xxyzz", we know that the next
+possible value we could have that satisfies this property is "aabcc". In order to go from "xxyzz" to
+"aabcc" however, you need to overflow which would increment the "p" to a "q". This gives an end
+result of "heqaabcc".
+
+QED.