← Goldman Sachs questions

String Compression and Goldmine Problem

Filed under Goldman Sachs

Implement a string compression method that replaces repeated consecutive characters with the character followed by its count (e.g., 'aabcccccaaa' -> 'a2b1c5a3'), and solve the Goldmine Problem (find…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.