Joined as well, thanks for creating it! Unfortunately I only have time 5-6 hours before the next day’s puzzle, so I am here only to collect 🌞s.
Joined as well, thanks for creating it! Unfortunately I only have time 5-6 hours before the next day’s puzzle, so I am here only to collect 🌞s.


I’ll check if someone created a guide for the clever solution, cos I’m interested. But I don’t have nearly enough knowledge about geometry to came up with one myshelf. (nor energy after the 10 hour workdays in the last two weeks…)


It was easy staight forward brtue force:
For each possible_rectange Find Max:
If polygon.contains(rectangle) Then rectangle.area() Else 0
For speed the loop can be run paralelley.
I had no time to implent the contains myself, but pretty much all languages have a library already.


Can I ask what phone did you buy? Only if you confortable to share it ofc. I am looking for a new one. I loved my Samsung Note9. Everything was great, it had stylus, jack, battery life, oled screen, decent cameras. The only thing missing is andoid OS update support. It still better than most middle range phones…
No
Commenting counts?
I solved with
geoas well. Brute force to all possible rectangles from the polygon points. Tried to run it but after 30 seckilled it and just importedrayon. It’s under 3 sec. There is no shame using libraries, it’s part of the puzzle to know whics one is useful 😄