advent-of-code-one-liners - GitLite

KO | EN

gitlite — search

#react #llm #golang #deep-learning #linux #docker #awesome #kubernetes #pytorch #security #mcp #ios #openai #open-source

advent-of-code-one-liners

(★ 122)

🐍📅 One-line Python solutions for Advent of Code 2022 and 2023.

파일 탐색기

최종 버전 다운로드 (.zip)

- day-01.py
- day-02.py
- day-03.py
- day-04.py
- day-05.py
- day-06.py
- day-07.py
- day-08.py
- day-09.py
- day-10.py
- day-11.py
- day-12.py
- day-14.py
- one-line-solutions.py
- the-beast.py
- day-01.py
- day-02.py
- day-03.py
- day-04.py
- day-05.py
- day-06.py
- day-07.py
- day-08.py
- day-09.py
- day-10.py
- day-11.py
- day-12.py
- day-13.py
- day-14.py
- day-15.py
- day-16.py
- the-basilisk.py
- 2022-day-07-meme.png
- 2022-day-10-beast-length.png
- 2023-day-03-regex-meme.png
- 2023-day-05-walrus-meme.png
- 2023-day-06-the-basilisk-viz.png
- 2023-day-07-the-basilisk-viz.png
- 2023-day-08-the-basilisk-viz.png
- 2023-day-09-the-basilisk-viz.png
- 2023-day-16-the-basilisk-viz.png
- why-use-long-code-meme.jpg
- create-blank-solution.py
- create-rainbow-line-svg.py
- import-input.py
.gitignore
README.md
requirements.txt

# 설치 가이드

1. 코드 내려받기

git clone https://github.com/savbell/advent-of-code-one-liners

깃허브에서 프로젝트 코드 전체를 내 컴퓨터로 내려받습니다.

cd advent-of-code-one-liners

방금 내려받은 프로젝트 폴더 안으로 이동합니다.

2. Python

쉬움 추천

사전 준비물

Git GitHub에서 프로젝트 코드를 내려받으려면 필요합니다.
Python 3 설치 시 'Add Python to PATH' 옵션을 꼭 체크하세요 (Windows).

pip install -r requirements.txt

requirements.txt 등에 명시된 파이썬 라이브러리를 설치합니다.

python <실행할 파일명>.py # README에서 정확한 실행 파일명을 확인하세요

파이썬 스크립트(또는 모듈)를 실행합니다.

✅ 에러 메시지 없이 실행되고 터미널에 안내 문구가 출력되면 정상입니다.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 🐍📅 Advent of Code One-Line Solutions
As a personal challenge, I'm trying to solve every [Advent of Code](https://adventofcode.com/) problem in a single line of Python code. No, my solutions are not optimal. Nor readable. Nor useful in any other way. But it's fun, so here we go!

I originally attempted this in 2022 and made it through about a dozen days. I'm now working on 2023 in real time! You can follow along on this repository or through [my Reddit posts](https://www.reddit.com/u/ImpossibleSav).

Note that per copyright and [Eric Wastl's request](https://www.reddit.com/r/adventofcode/wiki/faqs/copyright/inputs/), input files are not included in this repository, so you must replace the file paths if you would like to run this code.

I'm using Python version `3.11.3`. The solutions should not require any additional packages (I'm only importing from the [Python Standard Library](https://docs.python.org/3/library/index.html)), but in the [tools](#tools) folder, I have a script for importing the input files from the Advent of Code server that uses [`requests`](https://pypi.org/project/requests/) and a visualization tool that uses [`matplotlib`](https://pypi.org/project/matplotlib/) and [`svgwrite`](https://pypi.org/project/svgwrite).

## Progress Tracking
| Status | Description |
| ------ | ----------- |
| ❌     | Problem not attempted yet |
| ✍     | Working on original solution |
| ⭐     | Original (OG) solution finished, working on one-line solution |
| ✅     | Completed both OG and one-line solutions |
| ☑️     | Completed both solutions with help from others on the multi-line part |

### 2023 Solutions
| Day              | Part 1 | Part 2 | Commentary |
|------------------|--------|--------|------------|
| [01](2023/day-01.py) | ✅ | ✅ | This year, I'm removing my "no imports" restriction 😅 |
| [02](2023/day-02.py) | ✅ | ✅ | Getting in a lot of RegEx practice this year! |
| [03](2023/day-03.py) | ✅ | ✅ | Oh boy, the amount of RegEx I'm using is slowing down my computer... and [the Walrus](https://docs.python.org/3/whatsnew/3.8.html#assignment-expressions) is back! |
| [04](2023/day-04.py) | ✅ | ✅ | Pulling out some [dunder (magic) methods](https://docs.python.org/3/reference/datamodel.html#special-method-names) for this one! |
| [05](2023/day-05.py) | ✅ | ☑️ | `lambda`s are making their first appearance... And credit to [Dylan Gray](https://github.com/DylanDmitri) for his immense help with my Part 2 OG solution! |
| [06](2023/day-06.py) | ✅ | ✅ | `reduce` has joined the fray! |
| [07](2023/day-07.py) | ✅ | ✅ | First solution I didn't use RegEx... there goes that challenge for myself 😂 |
| [08](2023/day-08.py) | ✅ | ✅ | [`itertools.takewhile`](https://docs.python.org/3/library/itertools.html#itertools.takewhile) is a lifesaver! |
| [09](2023/day-09.py) | ✅ | ✅ | Gonna be a busy few days so I might fall behind for a bit... |
| [10](2023/day-10.py) | ✅ | ✅ | Not sure why this one took me until Day 17 to solve, but we finally did it! Proud of my Part 2 😁 |
| [11](2023/day-11.py) | ✅ | ✅ | So glad I didn't need to modify my approach for Part 2! |
| [12](2023/day-12.py) | ✅ | ☑️ | Credit to [Søren Fuglede Jørgensen](https://github.com/fuglede) for their solution for Part 2! |
| [13](2023/day-13.py) | ✅ | ✅ | I did go back and rewrite Part 1 after solving Part 2. This one took me a while for some reason! |
| [14](2023/day-14.py) | ✅ | ✅ | The hardest part is always the `while` loops! |
| [15](2023/day-15.py) | ✅ | ✅ | My fastest solve yet! |
| [16](2023/day-16.py) | ✅ | ✅ | Let's just ignore the `setrecursionlimit(30000)`... |
| [17](2023/day-17.py) | ✍ | ❌ |  |
| [18](2023/day-18.py) | ⭐ | ✍ |  |
| [The Basilisk](2023/the-basilisk.py) ||| A single line of code that combines all of the above days' solutions into one! |

### 2022 Solutions
Currently I am not working on 2022 problems, but this is where I left off:

| Day              | Part 1 | Part 2 | Commentary |
|------------------|--------|--------|------------|
| [01](2022/day-01.py)  | ✅     | ✅     |  |
| [02](2022/day-02.py)  | ✅     | ✅     |  |
| [03](2022/day-03.py)  | ✅     | ✅     |  |
| [04](2022/day-04.py)  | ✅     | ✅     |  |
| [05](2022/day-05.py)  | ✅     | ✅     | This one is a bit cheese but I'm doing my best. Requires Python 3.8 (https://peps.python.org/pep-0572/). |
| [06](2022/day-06.py)  | ✅     | ✅     |  |
| [07](2022/day-07.py)  | ✅     | ✅     | Even more cheese. But we got it! |
| [08](2022/day-08.py)  | ✅     | ✅     | Oh boy, I've started cheesing in my OG solutions now too. |
| [09](2022/day-09.py)  | ✅     | ✅     | Today's solution is brought to you by `x.insert(0, x.pop(0)+1)`. |
| [10](2022/day-10.py)  | ✅     | ✅     |  |
| [11](2022/day-11.py)  | ✅     | ✅     |  |
| [12](2022/day-12.py)  | ⭐     | ⭐     |  |
| [13](2022/day-13.py)  | ✍     | ❌     |  |
| [14](2022/day-14.py)  | ✅     | ✅     |  |
| [The Beast](2022/the-beast.py) ||| A single line of code that combines all of the above days' solutions into one! |

## Repo Organization
### Solutions
Within each year's folder:
- All the one-line solutions are combined into a single disgusting line of code that solves all the Advent of Code problems at once, nicknamed based on the year:
  - **2023:** [`the-basilisk`](2023/the-basilisk.py)
  - **2022:** [`the-beast`](2022/the-beast.py)
- The `day-xx.py` files have my first solution attempts and the resulting one-liners. See them to better understand what the blasphemous one-liners do.

### Images
I've created some visualizations and memes throughout the month. They can be found in the [images](https://github.com/savbell/advent-of-code-one-liners/blob/master/images/) folder.

Below is an example vizualization of the length of each day's solution in the Basilisk as of Day 8. I automated creating parts of it; see the tools below.

<img src="./images/2023-day-08-the-basilisk-viz.png" alt="A snake with rainbow bands where each colour corresponds to how many characters were used to solve each Advent of Code problem" width="500" height="500">

### Tools
- **[`create-rainbow-line-svg.py`](tools/create-rainbow-line-svg.py)**: Creates a rainbow line SVG image from a list of numbers, with each band a calculated percent of the whole. Used to automatically generate the colours and proportions for the visualization above. Also included is a tool for calculating the character counts in my one-line combined solutions, e.g. [The Basilisk](2023/the-basilisk.py), or all your solution files in a given year if you provide your first day's file name.
- **[`create-blank-solution.py`](tools/create-blank-solution.py)**: Creates a new file with a blank solution template for the given year and day. Written explicitly for myself, but feel free to modify it for your personal use if you'd like.
- **[`import-input.py`](tools/import-input.py)**: Requests the AoC server for a given day's input and saves it as a new text file. Try to [limit your use](https://www.reddit.com/r/adventofcode/wiki/faqs/automation/) of this tool to once per day.

## Some Strategy Explanations
Here are some fun ways I've been able to convert Python statements that normally require their own line into one-line expressions:
- **List comprehensions:** This entire thing wouldn't be possible without Python's [list comprehensions](https://docs.python.org/3/tutorial/datastructures.html#list-comprehensions), which allows you to have `for` and `if` statements within a single expression/line.
- **Short-circuit (lazy) evaluation:** Python has [short-circuit evaluation for its Boolean operations](https://docs.python.org/3/library/stdtypes.html#boolean-operations-and-or-not), which means the second expression in a Boolean operation is only evaluated if the result of the first expression does not guarantee the final result of the expression. This allows me to strategically use `and` and `or` to determine the order that expressions are executed, skipping around when necessary.
- **In-line assignment operator:** The [Walrus operator (`:=`)](https://docs.python.org/3/whatsnew/3.8.html#assignment-expressions) allows you to create and assign variables within an expression. I discovered it trying to parse [Day 5 in 2022](2022/day-05.py), and it has since been [a hard carry](images/2023-day-05-walrus-meme.png).
- **Updating a list element in-line:** Since the assignment operator cannot be used with subscripts, it cannot be used to update lists (e.g. `a[0] := 1` is invalid). My solution for [Day 9 in 2022](2022/day-09.py) was to pop the element, modify it, and then insert it back into the same position, e.g. `x.insert(0, x.pop(0)+1)`. Then, for [Day 4 in 2023](2023/day-04.py), I discovered the [`__setitem__()`](https://docs.python.org/3/reference/datamodel.html#object.__setitem__) method, which allows you to update a list element in-line, e.g. `x.__setitem__(0, x[0]+1)`. On [Day 5 in 2023](2023/day-05.py), I figured out [`x.__iadd__([0])`](https://docs.python.org/3/reference/datamodel.html#object.__iadd__) is equivalent to `x.append(0)`.
- **In-line import statements:** After not using import statements in 2022 since it would technically make my solutions more than one line, I discovered the built-in [`__import__()`](https://docs.python.org/3/library/functions.html#import__) function in 2023 that has finally allowed me to use [RegEx](images/2023-day-03-regex-meme.png) in my solutions.
- **My `while` loop within a list comprehension:** ~~I was very proud of discovering this while working on [2022's Day 8](2022/day-08.py). Since I wanted my list comprehension to end execution once a condition was met, I had a tracker variable turn `True` when it was and included it in the `for` condition. But to do this in a single line, I needed to add another `if` condition that simply creates and assigns the tracker variable `False`, making sure it ran before the main list comprehension was calculated. An example line with a tracker variable called `found`: `[(x < t[r][c]) or (found:=True) for x in t[r][:c][::-1] if not found] if not (found:=False) else ''`~~ <br /> **Update:** While solving [2023's Day 8](2023/day-08.py), I discovered [`itertools.takewhile(predicate, iterable)`](https://docs.python.org/3/library/itertools.html#itertools.takewhile), which solved my `while` loop problem in a much cleaner way! Thank goodness I removed my "no import" restriction for this year.

## Concluding Notes
Potential employers: I promise my production code is much, much better than this. Please don't blacklist me :(

... but if you're looking to reduce the lines of code in your codebase, I've got some ideas! ;)