recursion and closures.

Neither. Best I can say is always try to solve a task by solving its subtasks. Good luck!

yes, I originally did it in Python while completely ignorant of the built-in, lol, then I was all like WTF when I saw the solutions

Yes. I retrained this kata in java after "cheating" with python. Totally worth it.

any hints? Rather not look up the answer

Maff skills plus coding skills is a deadly combo.

Too bad I suck at both!

good kata although I feel like the page_item_count section could be a bit more rigorous. My code passed without accounting for the perfectly filled up pages

after looking at other people's solution...

LULZ

bit trickier than expected

I hate you.

probably not...From experience lot of interview problems resemble leetcode or hackerrank style of problems although every site has an overlap of problems.

cleanest answer without regex or groupby. I used groupby like a poser.

would it be worth it to do this problem without the builtin python module?

good learning experience?

heh trickier than i thought

COBOL translation, including random tests (author inactive).