aoc2023
advent-of-code
aoc2023 | advent-of-code | |
---|---|---|
12 | 34 | |
1 | 29 | |
- | - | |
8.6 | 5.6 | |
4 months ago | 5 months ago | |
Pyret | Python | |
MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
aoc2023
- -❄️- 2023 Day 11 Solutions -❄️-
- -❄️- 2023 Day 10 Solutions -❄️-
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
-
Advent of Code 2023 in your language
I eventually tend to do all days in Tailspin. The ones I have done so far are in directories ending in "tt" (the others are in Pyret, just to get a feel for it) https://github.com/tobega/aoc2023/tree/main
- -❄️- 2023 Day 7 Solutions -❄️-
- -❄️- 2023 Day 6 Solutions -❄️-
-
I have great difficulties
As a general tip, it is often helpful to first try to think of how you would like to represent the data in your program. Then you need to parse the data into that structure. I'd recommend you to look at a PEG-parser, for example. Or if you like, look at my Tailspin programming language which has a very visual parser syntax and also very visual ways of creating data structures (if that should happen to be your mental affinity). Look at my day1 for example. Or if you're more mathematical, maybe a functional language (I also did day1 in Pyret)
advent-of-code
-
-❄️- 2023 Day 11 Solutions -❄️-
[LANGUAGE: Python 3] 153/75 Raw solution
-
-❄️- 2023 Day 10 Solutions -❄️-
One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).
-
-❄️- 2023 Day 8 Solutions -❄️-
That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)
-
-❄️- 2023 Day 7 Solutions -❄️-
[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code
-
-❄️- 2023 Day 6 Solutions -❄️-
[LANGUAGE: Python 3] 66/101 Raw solution code
-
-🎄- 2022 Day 22 Solutions -🎄-
Python 3 21/12
-
-🎄- 2022 Day 20 Solutions -🎄-
It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.
-
-🎄- 2022 Day 19 Solutions -🎄-
Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.
-
-🎄- 2022 Day 15 Solutions -🎄-
Python 3 9/15!!!
-
-🎄- 2022 Day 14 Solutions -🎄-
Python 3 44/45
What are some alternatives?
advent_of_code_2023 - repo for advent of code 2023, xmas themed coding challenge
AdventOfCode.Template - Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
Advent-of-Code
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
AdventOfCode2023Julia - Advent of Code 2023 challenges done in Julia
advent-of-code-2022 - advent of code 2022
advent-of-code-2023-golang
advent_of_code
aoc - My Advent of Code 2023 Solutions
slushy - Advent of Code 2022 in Rust
advent-of-code - :santa: :christmas_tree: :snowman: http://adventofcode.com/ solutions
LEARN__Coding-Practices-and-Datastructures - Daily Coding Practices, Data structures, otherwise testing and some stuff. (Some garbage/some stuff)