Co můžete získat řešením programátorských hádanek? To vám poví Karolina Surma během přednášky "Za hranice základů Pythonu s Advent of Code.":python: 📚
https://cz.pycon.org/2023/program/talks/71/
#AdventOfCode #PyConCZ

Co můžete získat řešením programátorských hádanek?To vám poví Karolina Surma během přednášky "Za hranice základů Pythonu s Advent of Code." :python: 📚
https://cz.pycon.org/2023/program/talks/71/
#AdventOfCode #PyConCZ

Regarding the latest episode (049) of the #HackingTheGrepson podcast, I decided to make a more full-featured solution using the #FetchAPI. I now know how to pull puzzle input directly from the #adventofcode site, which is pretty cool.

https://carbon.now.sh/?bg=rgba%2874%2C144%2C226%2C1%29&t=material&wt=none&l=auto&width=871&ds=true&dsyoff=20px&dsblur=68px&wc=true&wa=false&pv=56px&ph=50px&ln=false&fl=1&fm=Fira+Code&fs=14px&lh=152%25&si=false&es=2x&wm=false&code=%252F%252F%2520AOC%25202019%253A%2520Day%25201%253A%2520The%2520Tyranny%2520of%2520the%2520Rocket%2520Equation%250A%250Alet%2520example_input_part_1%2520%253D%25200%250Alet%2520puzzle_input_part_1%2520%2520%253D%25200%250Alet%2520example_input_part_2%2520%253D%25200%250Alet%2520puzzle_input_part_2%2520%2520%253D%25200%250A%250Aasync%2520function%2520getAocInput%28%29%2520%257B%250A%2520%2520const%2520options%2520%253D%2520%257B%250A%2520%2520%2520%2520method%253A%2520%27GET%27%252C%250A%2520%2520%2520%2520headers%253A%2520%257B%250A%2520%2520%2520%2520%2520%2520cookie%253A%2520%2560session%253D%2524%257Bprocess.env.AOC_SESSION_TOKEN%257D%2560%250A%2520%2520%2520%2520%257D%250A%2520%2520%257D%253B%250A%250A%2520%2520return%2520fetch%28%27https%253A%252F%252Fadventofcode.com%252F2019%252Fday%252F1%252Finput%27%252C%2520options%29%250A%2520%2520%2520%2520.then%28response%2520%253D%253E%2520response.text%28%29%29%250A%2520%2520%2520%2520.then%28inputs%2520%253D%253E%2520inputs%29%250A%2520%2520%2520%2520.catch%28err%2520%253D%253E%2520console.error%28err%29%29%253B%250A%257D%250A%250Afunction%2520getFuel%28input%252C%2520should_recurse%29%2520%257B%250A%2520%2520let%2520fuel%2520%253D%2520Math.floor%28input%2520%252F%25203%29%2520-%25202%250A%250A%2520%2520if%2520%28fuel%2520%253C%253D%25200%29%2520%257B%250A%2520%2520%2520%2520return%25200%250A%2520%2520%257D%250A%250A%2520%2520%252F%252F%2520Part%25202%250A%2520%2520if%2520%28fuel%2520%253E%25200%2520%2526%2526%2520should_recurse%29%2520%257B%250A%2520%2520%2520%2520return%2520fuel%2520%252B%253D%2520getFuel%28fuel%252C%2520should_recurse%29%250A%2520%2520%257D%250A%250A%2520%2520%252F%252F%2520Part%25201%2520and%2520Part%25202%250A%2520%2520return%2520fuel%250A%257D%250A%250A%253B%28async%28%29%2520%253D%253E%2520%257B%250A%2520%2520%252F%252F%2520Part%25201%250A%2520%2520const%2520example_inputs%2520%253D%2520%255B12%252C%252014%252C%25201969%252C%2520100756%255D%250A%250A%2520%2520example_inputs.forEach%28input%2520%253D%253E%2520%257B%250A%2520%2520%2520%2520example_input_part_1%2520%252B%253D%2520getFuel%28input%252C%2520false%29%250A%2520%2520%257D%29%250A%250A%2520%2520console.log%28%2560Example%2520Input%2520Part%25201%253A%2520%2524%257Bexample_input_part_1%257D%2560%29%250A%250A%2520%2520const%2520aoc_result%2520%253D%2520await%2520getAocInput%28%29%250A%250A%2520%2520if%2520%28aoc_result%29%2520%257B%250A%2520%2520%2520%2520const%2520test_inputs%2520%253D%2520aoc_result.split%28%27%255Cn%27%29%250A%250A%2520%2520%2520%2520test_inputs.forEach%28input%2520%253D%253E%2520%257B%250A%2520%2520%2520%2520%2520%2520puzzle_input_part_1%2520%252B%253D%2520getFuel%28input%252C%2520false%29%250A%2520%2520%2520%2520%257D%29%250A%250A%2520%2520%2520%2520console.log%28%2560Puzzle%2520Input%2520Part%25201%253A%2520%2524%257Bpuzzle_input_part_1%257D%2560%29%250A%250A%2520%2520%2520%2520%252F%252F%2520Part%25202%250A%2520%2520%2520%2520example_inputs.forEach%28input%2520%253D%253E%2520%257B%250A%2520%2520%2520%2520%2520%2520example_input_part_2%2520%252B%253D%2520getFuel%28input%252C%2520true%29%250A%2520%2520%2520%2520%257D%29%250A%250A%2520%2520%2520%2520console.log%28%2560Example%2520Input%2520Part%25202%253A%2520%2524%257Bexample_input_part_2%257D%2560%29%250A%250A%2520%2520%2520%2520test_inputs.forEach%28input%2520%253D%253E%2520%257B%250A%2520%2520%2520%2520%2520%2520puzzle_input_part_2%2520%252B%253D%2520getFuel%28input%252C%2520true%29%250A%2520%2520%2520%2520%257D%29%250A%250A%2520%2520%2520%2520console.log%28%2560Puzzle%2520Input%2520Part%25202%253A%2520%2524%257Bpuzzle_input_part_2%257D%2560%29%250A%2520%2520%257D%2520else%2520%257B%250A%2520%2520%2520%2520console.error%28%27could%2520not%2520fetch%2520test_inputs%27%29%250A%2520%2520%257D%250A%257D%29%28%29

New Hacking the Grepson podcast episode is out!

Hacking the Grepson 049: Improv of Code (AOC 2019.1)

We tackle an unknown Advent of Code problem together.

Episode Link: https://www.podbean.com/eas/pb-nepfd-149a73d
Show Feed: https://feed.podbean.com/hackingthegrepson/feed.xml
Show Home: https://hackingthegrepson.com

#HackingTheGrepson #podcast #programming #development #adventofcode

Un CANAL de #AdventOfCode

Retos de código que son buena cosa 🤸🤸‍♂️🤸‍♀️

https://fediverse.tv/c/adventofcode2020/videos?s=1

New Hacking the Grepson podcast episode is out!

Hacking the Grepson 031: Advent of Code 2022, Part 4

We finally wrapup Advent of Code 22, and talk about days 19-25.

🎧 https://www.podbean.com/media/share/pb-zdrmm-134ae4c
➕ https://feed.podbean.com/hackingthegrepson/feed.xml
🔗 https://hackingthegrepson.com

#HackingTheGrepson #podcast #programming #development #AdventOfCode

OK, I think I have run out of steam with #AdventOfCode at week 16. I will take a break and see if I want to return and perhaps go through the solution of others just to complete it, let's see..

I just completed all 25 days of Advent of Code 2022! #AdventOfCode https://adventofcode.com/

An easy one this time, but I managed to stumble (n *= 5 + d is the same as n = n * 5 + d, right? Right?)

I just completed "Blizzard Basin" - Day 24 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/24

This was fun fun fun fun fun! My first approach was too slow, my second was too simplistic and also totally incorrect, my third one eventually was just right!

Part 2 was very easy given my solution to part 1, which is rare for AoC.

I just completed "Unstable Diffusion" - Day 23 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/23

This wasn't particularly hard once I read the instructions properly after failing.

I've completed "Distress Signal" - Day 13 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/13

I just completed "Monkey Map" - Day 22 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/22

Part 1 was straightforward, part 2 was very fiddly. I have this stupid pride that requires me to write a program to solve the cube folding properly instead of hardcoding the foldings for the actual input data I had. This took me six hours (with some breaks)!

New Hacking the Grepson podcast episode is out!

Hacking the Grepson 030: Advent of Code 2022, Part 3

Matt and Mike (me) discuss days 12-18. Spoilers ahead.

🎧 https://www.podbean.com/media/share/pb-q9ka4-13402b5
➕ https://feed.podbean.com/hackingthegrepson/feed.xml
🔗 https://hackingthegrepson.com

#HackingTheGrepson #podcast #programming #development #AdventOfCode

I just completed "Monkey Math" - Day 21 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/21

Solved it by implementing symbolic evaluation of first degree polynomials over ... floats. Had to .round() to get answer the website would accept. If it works, it's not stupid, right?

Anyway off to try out the num_rational crate because this is about learning Rust and not about collecting stars.

First year doing #AdventOfCode and it's really cool. I am on day 15, five days behind!! Annoyed but not giving up :)

I just completed "Grove Positioning System" - Day 20 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/20

This was ... finicky.

I just completed "Not Enough Minerals" - Day 19 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/19

This was **hard**. I did my usual thing, then got discouraged when it took two minutes of computation to get OOM killed. Faffed about before deciding to use smaller data types (u8) for a lark, and my solution unexpectedly passed!

I just completed "Boiling Boulders" - Day 18 - Advent of Code 2022 #AdventOfCode https://adventofcode.com/2022/day/18

Part 1 was easy, part 2 was frustrating. I got a simple DFS wrong, multiple times.

Did not get around to #lovebytetcc 2022 Day 6 today, but I did return to some old #pico8 projects I worked on about 6 years ago. I apparently tried my hand at Pong, Snake, and Arkanoid clones, getting further on each than I remember. It lead me down a path of refactoring and improving each of them. I enjoy the simplicity of retro programming and it’s a nice break from the intense engineering (for me) that #AdventOfCode has been this week.

That's day 13 of #AdventOfCode solved! Lucky we have IComparable 😁 https://youtu.be/dfM1UGOWE8o #dotnet #csharp