cupcakearmy/advent-of-code
1
0
Fork 0
mirror of https://github.com/cupcakearmy/advent-of-code.git synced 2024-12-22 08:06:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Nicco 2020-12-02 13:24:17 +01:00 committed by GitHub
parent 3cdc3b3947
commit 87b00e472d
1 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
solutions/2/README.md
View File

@ -4,3 +4,18 @@ For the first we can simply count the occurrences and see if they are between th
Just some simple parsing. Just some simple parsing.
The second one is similar, but we can be more efficient if we XOR the first and second position. The second one is similar, but we can be more efficient if we XOR the first and second position.
# 2
For the first we can simply count the occurrences and see if they are between the accepted values.
Just some simple parsing.
The second one is similar, but we can be more efficient if we XOR the first and second position.
<details>
<summary>Solutions</summary>
<ol>
<li>548</li>
<li>502</li>
</ol>
</details>