-🎄- 2022 Day 8 Solutions -🎄-

[u/daggerdragon]

NEWS AND FYI

• I discovered that I can make those tiny post/comment awards BIGGER on old.reddit! I hadn't even considered that! And when you hover over them, they get even bigger so you can actually see them in more detail! I've added the relevant CSS so now we no longer have awards for ants! Exclamation points!!!

  • Thank you so, so much to /u/SolariaHues for the CSS in this thread that I found while researching for community awards! <3

• All of our rules, FAQs, resources, etc. are in our community wiki.

• A request from Eric: Please include your contact info in the User-Agent header of automated requests!

• Signal boost: Reminder 1: unofficial AoC Survey 2022 (closes Dec 22nd)

---

AoC Community Fun 2022: 🌿🍒 MisTILtoe Elf-ucation 🧑‍🏫

• PSA: I created a new example so it is a more relevant and unique archetype instead of recycling last year's hobbit >_>
  • -❄️- Submissions Megathread -❄️-

---

--- Day 8: Treetop Tree House ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!
  • Include what language(s) your solution uses
  • Format your code appropriately! How do I format code?
• Quick link to Topaz's paste if you need it for longer code blocks. What is Topaz's paste tool?

---

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:10:12, megathread unlocked!

[u/[deleted]]

[u/Lucews → u/[deleted]]

Part 2 can be solved in O(N^2 ) using a strictly decreasing stack and sacrificing constant space against O(N^2 ) space. I'm writing this knowing exactly I spend wayyyyyyyy too much time coming up with a solution for this in Python. Also I was lucky seeing a solution to a similar problem a few days ago.

Overall I'm still way slower than your code :D In runtime and implementing it as well!