Loading the journal
Loading the journal
Run-Length Encoding / Two PointersSolved Oct 31, 2025
Problem
Given a string S composed of repeating characters, compress it using Run-Length Encoding (RLE). The compressed string should consist of each unique character followed by the count of its consecutive occurrences. (e.g., "AAABBC" becomes "A3B2C1").
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code