How should I practice Better Compression 🦀?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Atlassian online assessment problems in FastPrep.

Is Better Compression 🦀 associated with Atlassian?

FastPrep tags this as a Atlassian coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · String

Better Compression 🦀

Learn this problem

● EasyAtlassianINTERNOA

Problem statement

Consider a string, S, that is a series of characters, each followed by its frequency as an integer. The string is not compressed correctly, so there may be multiple occurrences of the same character. A properly compressed string will consist of one instance of each character in alphabetical order followed by the total count of that character within the string.

Example The string 'a3c9b2c1' has two instances where 'c' is followed by a count: once with 9 occurrences, and again with 1. It should be compressed to 'a3b2c10'.

Function

betterCompression(S: String) → String

Complete the function betterCompression in the editor below.

betterCompression has the following parameter:

S: string: a compressed string

Returns

string: the properly compressed string

Examples

Example 1

S = "a3c9b2c1"return = "a3b2c10"

The string 'a3c9b2c1' has two instances where 'c' is followed by a count: once with 9 occurrences, and again with 1. It should be compressed to 'a3b2c10'.

Constraints

1 ≤ size of S ≤ 100000
'a' ≤ characters in S ≤ 'z'
1 ≤ frequency of each character in S ≤ 1000

Problem statement

Function

Examples

Example 1

Constraints

More Atlassian problems