Day 2: Cube Conundrum

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ or pastebin (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ

🔒This post will be unlocked when there is a decent amount of submissions on the leaderboard to avoid cheating for top spots

🔓 Edit: Post has been unlocked after 6 minutes

  • snowe@programming.dev
    4·
    11 months ago

    Ruby

    https://github.com/snowe2010/advent-of-code/blob/master/ruby_aoc/2023/day02/day02.rb

    Second part was soooo much easier today than yesterday. Helps I solved it exactly how he wanted you to solve it I think.

    I’m going to work on some code golf now.

    Golfed P2 down to 133 characters:

    p g.map{_1.sub!(/.*:/,'')
m=Hash.new(0)
_1.split(?;){|r|r.split(?,){|a|b,c=a.split
m[c]=[m[c],b.to_i].max}}
m.values.reduce(&:*)}.sum
    • sjmulder@lemmy.sdf.org
      0·
      11 months ago

      That’s a nice golf! Clever use of the hash and nice compact reduce. I got my C both-parts solution down to 210 but it’s not half as nice.

      • snowe@programming.dev
        1·
        11 months ago

        Thanks! Your C solution includes main, whereas I do some stuff to parse the lines before hand. I think it would only be 1 extra character if I wrote it to parse the input manually, but I just care for ease of use with these AoC problems so I don’t like counting that, makes it harder to read for me lol. Your solution is really inventive. I was looking for something like that, but didn’t ever get to your conclusion. I wonder if that would be longer in my solution or shorter 🤔