Day 20: Race Condition

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)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

  • Gobbel2000@programming.dev
    4·
    2 days ago

    There is exactly one path without cheating, so yes, the distance to one end is always the total distance minus the distance to the other end.

    • gedhrel@lemmy.world
      2·
      2 days ago

      Gotcha, thanks. I just re-read the problem statement and looked at the input and my input has the strongest possible version of that constraint: the path is unbranching and has start and end at the extremes. Thank-you!

      • Deebster@programming.devEnglish
        2·
        2 days ago

        I missed that line too:

        Because there is only a single path from the start to the end

        So I also did my pathfinding for every variation in the first part, but realised something must be wrong with my approach when I saw part 2.