Gamified challenge · Run-length encoding
A scroll is a string of letters (a-z, A-Z; upper and lower case are different letters). Write compress(scroll) that replaces every maximal run of the same letter by the letter followed by the run's length, and returns the result.
The count is always written, even for a single letter, and can have several digits. "aaabccdddd" becomes "a3b1c2d4", "Hello" becomes "H1e1l2o1", and an empty scroll stays "".
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google