How would you have asked this instead?

Thanks for the tip.

Woop, really great! Hope that was fun! How much time did it take you to solve that? It was a longer while for me. What was the "aha" for you here? :)

I'm sure there are people out there who would believe that ;)

Why bother lying to yourself? :)

Sure it did - that's why reverse is hidden. Maybe you missed that? Either way don't be afraid to take the challenge - it's loads of fun to figure this one out!

Thumbs up!

At first I didn't get it but after several hours I've foundbseveral approaches to do this; having chosen the best one it turned out to be the same as what you linked to :) I think key was being able to hold the whole problem in my head at once. That made it easier to reason about it. Try deriving the solution on your own; see where that gets you. You need to spend a lot of time on it though. I think this kata should be more than 6 kyu, maybe 5 or 4.

Let me know tomorrow if you haven't found it and I'll help you find it.

What beautifully obfuscated code! First it bulds up the list in the third element of the triple, going all the way from the very inside of the foldr structure to the very outside. At the outside, the 2nd element gets used as the return value of the top-level function. It gets evaluated with a definition of foldl hidden in the first element of the tuple passed to g on the last line, as well as in the 2nd element returned in the [] case. Still, implements foldl without using foldr - try doing it that way - it's trickier!

Try without reimplementing reverse - much trickier, but also loads of fun!

Looks like abuse of @Pl :))

Try using foldr and without reimplementing reverse - it's tricky, but loads of fun!

Try without reimplememtimg foldl or reverse - it's trickier but also loads of fun!

Try again - and don't reimplement reverse - it's loads of fun!

You've reimplEnted foldl - try doing it with foldr like the kata suggests, without using reverse! It's much more fun!