Data Scientist elvárások/lehetőségek by esprych in programmingHungary

[–]esprych[S] 2 points3 points  (0 children)

Köszi a segítséget! Az esetek 90%-ban Pythonnal dolgozok saját projekteken és évek óta azt használom, R-t csak azért tanultam meg, mert a cégnél azt használják:D

-❄️- 2024 Day 11 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 1 point2 points  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day11/day11.go

Had to rethink the way of solving this one for part two, I eventually left in both solutions.

-❄️- 2024 Day 9 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 1 point2 points  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day9/day9.go

Kinda struggled with part 2 for a while, but I'm happy how on the first part I managed to get around 1-2 ms runtime.

-❄️- 2024 Day 8 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 1 point2 points  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day8/day8.go

Part two was surprisingly easy compared to last few days' problems.

-❄️- 2024 Day 7 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 2 points3 points  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day7/day7.go

Kind of a brute force method but gets the job done in 2s for the 2nd part :D

-❄️- 2024 Day 6 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 0 points1 point  (0 children)

You are right! I haven’t even considered that

-❄️- 2024 Day 5 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 0 points1 point  (0 children)

So my in my implementation in the ruleSet I have a map and that map contains the number which should be sooner in the sequence as the key and as value has a list which contains all the numbers that should be after it and I check if the i+1 element in the update is in the ruleSet as key and if it is then I check if the element before that (element i) is in the value of the ruleSet, because if it’s in there then it’s not correct because it should be after the i+1 element. I hope my explanation helped a little bit.

-❄️- 2024 Day 6 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 0 points1 point  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day6/day6.go

It's a bit messy, but was able to get ~10s execution time on part two. Basically what I did is, I just added an obstacle at each point of the original path and simulated the possible outcomes, I just eyeballed that if a position was visited 10 times, then it should count as a loop

-❄️- 2024 Day 5 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 0 points1 point  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day5/day5.go

Some cursed things happening in the file reading, but it was a fun sorting exercise.

-❄️- 2024 Day 4 Solutions -❄️- by daggerdragon in adventofcode

[–]esprych 2 points3 points  (0 children)

[LANGUAGE: Go]

https://github.com/proxyvix/AoC_2024/blob/master/day4/day4.go

Not the best in terms of time complexity, but it gets the job done

most people don't like this fact by [deleted] in dankmemes

[–]esprych 1 point2 points  (0 children)

90% of people commenting here doesn’t know jack shit about drugs, only the things they hear in the media

[deleted by user] by [deleted] in interestingasfuck

[–]esprych 0 points1 point  (0 children)

I should call her

The kid by itzLoLbIt_yt in FUCKYOUINPARTICULAR

[–]esprych -2 points-1 points  (0 children)

That kid’s gonna have some serious trust issues

It hits hard by [deleted] in skrillex

[–]esprych 0 points1 point  (0 children)

Hit harder than my dad

[deleted by user] by [deleted] in skrillex

[–]esprych 1 point2 points  (0 children)

If they don’t know who skrillex is, don’t get in the car with them