cupcakearmy/advent-of-code
1
0
Fork 0
mirror of https://github.com/cupcakearmy/advent-of-code.git synced 2025-12-13 21:34:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

08

Browse Source
This commit is contained in:
cupcakearmy
2021-12-08 13:08:18 +01:00
parent d3427a2651
commit a4f671a6cc
2 changed files with 196 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
2021/08/README.md Normal file
View File

@@ -0,0 +1,27 @@
# 08
This was super fun and another episode of "I should have gotten my paper out sooner".
As soon as I realized you can take the statistical approach to decode the numbers.
1. Count all characters
This will reveal the mapping for the letters `b`, `e` and `f`, as they appear a unique amount of times.
2. `a` & `c`
Both appear 8 times. We find `a` by looking at the `1` and `7`. If we identify `1` (cf) and `7` (afc) we can simply calculate what `a` is by difference. With `a` identified `c` is also determined.
3. `d` & `g`
Both appear 7 times. We take the similar approach as in 2.
This ensures a linear time execution.
<details>
<summary>Solutions</summary>
<ol>
<li>449</li>
<li>968175</li>
</ol>
</details>