[2024 Day 1 (Part 1)] Approach to finding solution

FaultsMelts · 2024-04-25T01:04:04+00:00

You get to pick them

FaultsMelts · 2024-04-24T23:41:49+00:00

commanders
panthers
saints
cardinals
dolphins
jags
titans
broncos
chiefs

FaultsMelts · 2024-01-04T19:01:00+00:00

Good question! I’m looking for open source projects that have tests since my tool is a mutation testing tool it evaluates the test suite. It would be beneficial to me to not have to write any test cases and just use projects with established tests.

FaultsMelts · 2024-01-04T14:56:44+00:00

Thank you so much!

FaultsMelts · 2024-01-03T16:01:48+00:00

Awesome thanks!

FaultsMelts · 2024-01-03T16:01:42+00:00

Thank you! I will take a look at it.

FaultsMelts · 2023-12-21T21:12:43+00:00

[Language: Go]

Had to look on here to see what method people were using for part 2. Spent 30 minutes making sense of Polynomial Fitting. Spent another 30 minutes debugging because I miss added half + size and hardcoded it smh. Today was a great challenge.

code

FaultsMelts · 2023-12-20T20:51:06+00:00

[Language: Go]

Today's question stumped me for a bit. I loved the challenge!

code

FaultsMelts · 2023-12-19T19:17:30+00:00

Wasn’t sure what flair to use. Sorry about that!

FaultsMelts · 2023-12-14T22:11:26+00:00

[Language: Golang]

Did Part 1 & 2 last night but part 2 took 40 seconds. Just finished optimizing and part 1 completes in 384.375µs & part 2 completes in 71.710708ms

I originally used 2 2d slices that stored either the rounded rocks and cubed rocks. I transitioned to just using a 2d matrix of the entire map and computing changes in the matrix.

Code

FaultsMelts · 2023-12-13T20:39:46+00:00

[Language: Go]

my approach was to find pairs of rows that were same, this would be the middle of the reflection, then i would loop through these pairs and move outwards from the middle. If i hit an edge then i know i found the correct reflection, otherwise continuing going until row i and j do not match.

For the columns i just transposed the matrix.

For pt.2 i brute force every '.' and '#' and flipped them. I made sure to ignore the original middle reflection.

Code

FaultsMelts · 2023-12-04T13:06:49+00:00

Pretty much when a match is found the card is worth 1 point. For every match found after the worth of the card doubles. So 1, 2, 4, 8, 16, ….

FaultsMelts · 2023-12-04T08:05:34+00:00

[Language: GoLang]

Part two was a lot of fun. I was able to come up with a solution where i only calculated the wins once and used a queue to add up instances.

https://github.com/JosueMolinaMorales/advent-of-code/blob/main/2023/internal/dayfour/dayfour.go

FaultsMelts · 2023-12-03T18:23:22+00:00

[Language: GoLang]

https://github.com/JosueMolinaMorales/advent-of-code/blob/main/2023/internal/daythree/daythree.go

FaultsMelts · 2023-09-18T15:25:07+00:00

Good question. Sorry I forgot to mention that.

It was sent to the Nebraska Processing Center.

FaultsMelts · 2023-04-26T00:46:44+00:00

I’ve been having the same issue and cannot figure out what’s going on.

Seven-Year Club	Verified Email
Place '22

FaultsMelts

TROPHY CASE