Shortest run-length encoding after deleting k characters
Run-length encoding writes each run of a repeated character as the character followed by the run length when the run is longer than one, so "aaabcc" becomes "a3bc2". Given a string and an integer k, delete at most k characters so that the encoded string is as short as possible, and return that length.
No answer yet. Write the first one; the best answer gets endorsed.
