String Run-Length Encoding | Dataford Interview Questions

Given a string, how would you write a function that returns each character with its consecutive count, like aaaaffffggaa -> a4f4g2a2?

Return one character-count pair for each maximal consecutive run, preserving the original order. The function should return an empty string for empty input and treat characters as case-sensitive.

def encode_runs(s): accepts a string and returns a string.

Constraints

0 <= len(s) <= 100000
s contains Unicode characters supported by Python strings
Character comparison is case-sensitive
Counts may contain multiple digits

Function Signature

def encode_runs(s):

Your question is String Run-Length Encoding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem