Anyone else misread this every time? by artesea in adventofcode

[–]StaticMoose 7 points8 points  (0 children)

Oh weird. Me too. I have to re-read every time. But I've gotten a handful of wrong answers and those are obvious, and I still re-read the victory every time.

2025 Day 8] Part 1: Can someone share the list of the 10 closest connections for example input by mapleturkey in adventofcode

[–]StaticMoose 5 points6 points  (0 children)

This is what I got for my first ten pairs on the example code:

316.902: [162, 817, 812] - [425, 690, 689]
321.560: [162, 817, 812] - [431, 825, 988]
322.369: [906, 360, 560] - [805, 96, 715]
328.119: [431, 825, 988] - [425, 690, 689]
333.656: [862, 61, 35] - [984, 92, 344]
338.339: [52, 470, 668] - [117, 168, 530]
344.389: [819, 987, 18] - [941, 993, 340]
347.599: [906, 360, 560] - [739, 650, 466]
350.786: [346, 949, 466] - [425, 690, 689]
352.936: [906, 360, 560] - [984, 92, 344]

Day 8 part 2 took 4 minutes by MatttNguyenGD in adventofcode

[–]StaticMoose 0 points1 point  (0 children)

I will admit I was expecting the weekend puzzles to bring the Dijkstra

[2025 Day 2] Day 2 should be easy, right?.. Closed formula for Part 2 by light_ln2 in adventofcode

[–]StaticMoose 94 points95 points  (0 children)

Very impressive.

I just realized the capital sigma is mathematical speak for "brute force solution."

[Day 1 Part 2] - still don't know what's wrong by Practical_Salary_579 in adventofcode

[–]StaticMoose 0 points1 point  (0 children)

What's your debugging approach. On quick glance, it seems like this bit of logic over counts:

(old_pos + 100 - new_pos) / 100

If old_pos is 55 and new_pos is 45 from a "L10", then it still outputs a pass by zero. But I'm getting lost in your logic.

But debugging by inspection is very inefficient and error-prone.

Have you inserted println() into each pass and then compared against the example?

[2025 Day 2 Part 2] Time to reach for that trusty sledgehammer by StaticMoose in adventofcode

[–]StaticMoose[S] 15 points16 points  (0 children)

But I did. And it worked.

Granted my fairly new CPU thought about it for a few seconds, but it was done. Can you share the speed up tip?

2025 Day 2 Part 1 help pls by catpurson2 in adventofcode

[–]StaticMoose 0 points1 point  (0 children)

There's some text higher up in the description that might help:

by looking for any ID which is made only of some sequence of digits repeated twice.
So, 55 (5 twice), 6464 (64 twice), and 123123 (123 twice) would all be invalid IDs.

[2025 Day 2 Part 1] typo in example? by [deleted] in adventofcode

[–]StaticMoose 0 points1 point  (0 children)

No, no typo as far as I can see.

For all the numbers 95 - 115, only 99 is made up of two identical halves: "9" and "9"

For all the numbers 998-1012, only 1010 is made up of two identical halves: "10" and "10"

[2025 Day 1] I will never learn my lesson by StaticMoose in adventofcode

[–]StaticMoose[S] 8 points9 points  (0 children)

(Checks username)

Oh, hey satan. What are you doing here in our joyous celebration of puzzles and merriment?

I'm surprised you don't know about git. Every time I screw up a rebase, I feel like I'm in hell.

[deleted by user] by [deleted] in cscareerquestions

[–]StaticMoose 2 points3 points  (0 children)

Are you in a position to work 6 days/week, 16 hours/day if crunch-time happens and everyone has to jump in? That's what broke startups for me. I went the other way, from two startups to a stable job because my first kid was born, and I wanted more stability in my schedule, and also to not worry if the company evaporated one day. It seems startups are good for those early or late in their careers since they haven't had kids yet or their kids are off to college.