This has been fixed, I'll mark it as resolved.

You can copy and paste the code directly from DTALC, and that'd solve the whole kata, but it's also relative easy to just implement stuff along by solely looking at the types and nothing else. So it's not as bad as you described. (Even Lensmaker is like this, just with a boundary ridiculous amount of type awareness required)

I do agree that this kata has a very bad description though. The initial code is far from sufficient to let people do anything, so in essence it's just an unreasonably high brick wall.

You can think of it as partial application, at least with anagrams w, but the correct term is actually η-reduction.

add3 x = x + 3
       = (+) 3 x
-- eta-reduction:
add3'  = (+) 3
-- which is actually a partial application of (+)

add3'' x = add3' x
-- The eta-reduction yields: add3'' = add3'.
-- But that's not a partial application of add3'.
-- It is however, indirectly, a partial application of (+).

The Haskellwiki contains an article on pointfree, which might interest you. Note that while pointfree-style is sometimes succinct, it can also lead to obfuscation.

No worries. By the way if you think that there's something wrong with a kata, mark your comment as "Issue". That way, your comment stands out and others can check whether the issue has been reported.

Have checked the test cases. They seem fine. Would you mind sharing your code? Don't forget to mark it as spoiler and add proper formatting.

It should be working now.