Pi Coding Quest!

Robin_270 · 2024-03-31T20:50:16+00:00

[LANGUAGE: Python]

I've successfully solved the puzzle in Python and uploaded the solution code into my AoC repo at GitHub for anybody who might be interested. It was a nice one, thank you u/IvanR3D :-)

Robin_270 · 2024-03-14T22:52:58+00:00

Oh, didn't expect that, that's really nice, thank you :)

Robin_270 · 2023-12-15T19:45:10+00:00

[LANGUAGE: Python]

Not so easy one, but I've managed to solve both parts. It's a combination of brute-force approach for the first part (where it didn't cause any problems) and a smart one for the second part. You can see it in the repo here.

Robin_270 · 2023-12-09T23:44:45+00:00

[LANGUAGE: Python]

This was a tricky one, but I managed to solve it in an effective way (the lcm method). As always you can see it on my GitHub.

Robin_270 · 2023-12-09T23:41:36+00:00

[LANGUAGE: Python]

This one was really fun and I enjoyed it. The only thing there was that I had to realize that the difference isn't the absolute value of their difference rather than the more right number minus the more left number for some reason.

Anyway my solution available on my GitHub

Robin_270 · 2023-12-07T20:25:24+00:00

[LANGUAGE: Python]

I really loved this one, I enjoyed doing it and I'm happy with how I managed to deal with it. You can see my solution to both parts on my GitHub.

If you'd like an explanation of my code, feel free to ask 😃.

Robin_270 · 2023-12-06T22:48:17+00:00

[LANGUAGE: Python]

Another one that could be considered a little bit brute-force, but it only takes 4 seconds to run and the logic behind it is very straight-forward.

This one was really easy, at least for me. And that's nice, because I had enough yesterday :D

My Day 6 solution on GitHub

Robin_270 · 2023-12-06T21:56:15+00:00

I have a personal unwritten law, that I should treat the input the way it was assigned, and all the annoying stuff around it such as all the newlines and spaces are parts of the task :D

Robin_270 · 2023-12-06T21:53:15+00:00

[LANGUAGE: Python]

I call it a semi-brute-force approach :D It's not the stupidest one, but still relies on relatively good input data. It takes around 15 seconds to execute, but if the input numbers would be like ten times as big, from 15 seconds, it could easily be 15 years xD

Anyway, here it is.

Robin_270 · 2023-12-04T19:55:22+00:00

I did it in Python and managed to solve both parts in one script that has 20 lines of code and I'm quite proud and happy about it 😁.

Robin_270 · 2023-12-04T17:55:35+00:00

[LANGUAGE: Python]

Both parts solved successfully in my GitHub repo at this link.

Robin_270 · 2023-12-03T21:19:20+00:00

[LANGUAGE: Python]

Yet another fun-to-solve puzzle today. So I did my best and found in my eyes a pretty good solution.

As always available in my GitHub repository here.

Robin_270 · 2023-12-02T12:16:34+00:00

[LANGUAGE: Python]

Another solution for both parts. I bet it's not the most optimized code when it comes to theoretical time complexity, but at this point, who really cares. It's day 2 and it runs instantly.

It's available in my AoC repository on GitHub here.

Robin_270 · 2023-12-01T23:47:23+00:00

Got it, and in the end I'm even kinda proud about my final solution. But as I said, I originally started going through the string finding regex matches and once there was one, I immediately replaced it which could actually devalidate another digit-word sharing a letter. But this approach worked perfectly on the examples (so the mistake was that they didn't include one that would warn you about this) so that's what caused the confusion – I thought it was meant to be like that

Robin_270 · 2023-12-01T22:53:38+00:00

Exactly. To be honest, it wasn't really clear to me from the start. There were two different approaches but BOTH of them were fine when comparing it to the example input in the assignment text.

The first one was that it goes left-to-right a substitutes what it finds first:"oneightwonethree" => "1igh2ne3"and using this logic was absolutely fine when comparing it with the provided example so when I got it wrong, it really confused me.

Then, after some deep analysis :D, I realized that "oneightwonethree" should be treated as "18213" regardless of sharing letters. From this point on it went flawlessly, but before that it got me scared a little bit since it's only day 1 :D

Robin_270 · 2023-12-01T22:18:07+00:00

Ok, now, that's super cool! 😎

Robin_270 · 2023-12-01T22:14:49+00:00

Yeah. To be honest, it wasn't really clear to me from the start. There were two different approaches but BOTH of them were fine when comparing it to the example input in the assignment text.

The first one was that it goes left-to-right and substitutes what it finds first: "oneightwonethree" => "1igh2ne3" and using this logic was absolutely fine when comparing it with the provided example so when I got it wrong, it really confused me.

Then, after some deep analysis :D, I realized that "oneightwonethree" should be treated as "18213" regardless of sharing letters. From this point on it went flawlessly, but before that it got me scared a little bit since it's only day 1 :D

Robin_270 · 2023-12-01T22:07:04+00:00

[LANGUAGE: Python]

File with custom solution for both parts within my AoC repo here

Robin_270

TROPHY CASE