Forum Discussion
Halloween 2026 Scheduling Challenge 🎃
(first solution)
This is the slipping a thunk-through-a-keyhole method! For me it's not readily apparent what's going on until I sit down and really step through the calculations that I can appreciate the mental model being used. It takes a lot of skill to create 'sch' and not have it realized until you iterate over it with MAP and then you're pulled out what you need and assembling the result.
This is an interesting approach I've used in moving aggregation:
∂, M3:M10 - SEQUENCE(, ROUNDUP(MAX(M3:M10) / 2, 0), 2, 2),The only downside is creating and then discarding extra values when a treat is out of stock. Given the limitations of the current build (Nested arrays not yet in general release), it's a valid approach and the calculation times are generally good.
My favorite part is how you setup SCAN with an array of 2s and 1s. Very nice!
run, SCAN(0, 1 + (qty >= 0), SUM),
Thanks Patrick2788​ for you feedback.
Nested arrays not yet in general release
Indeed, not being able to use nested arrays, which is possible in GS, limits certain solutions; this should be overcome by the new capabilities introduced in the ßeta version.
With 3 at 2nd parameter in TOCOL I dropped the excess ones, thinking it was the best compromise.
Bye