String Compression at Goldman Sachs
Medium59.5% acceptance
This problem has 62.5% frequency at Goldman Sachs.
Problem Description
Given an array of characters `chars`, compress it using the following algorithm: Begin with an empty string `s`. For each group of **consecutive repeating characters** in `chars`: * If the group's length is `1`, append the character to `s`. * Otherwise, append the character followed by the gro...
Read full problem and hintsTopics
Also asked at 42 companies
More Goldman Sachs Questions
Trapping Rain WaterHardFraction to Recurring DecimalMediumFirst Unique Character in a StringEasyLongest Substring Without Repeating CharactersMediumContainer With Most WaterMedium
View all Goldman Sachs questions