Search
⌘K
Get Premium
Leetcode 3167. Better Compression of String
Given a string composed of character–count pairs (with counts possibly multi-digit and the same character appearing multiple times), parse and sum counts for each character, then return a compressed string listing each character once with its total count, typically sorted lexicographically.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.