Register for our webinar

### How to Nail your next Technical Interview

1 hour
1
Enter details
2
Select webinar slot
*Invalid Name
*Invalid Name
Step 1
Step 2
Congratulations!
You have registered for our webinar
Oops! Something went wrong while submitting the form.
1
Enter details
2
Select webinar slot
*All webinar slots are in the Asia/Kolkata timezone
Step 1
Step 2
Confirmed
You are scheduled with Interview Kickstart.
Redirecting...
Oops! Something went wrong while submitting the form.

## You may be missing out on a 66.5% salary hike*

### Nick Camilleri

Head of Career Skills Development & Coaching
*Based on past data of successful IK students
Help us know you better!

## How many years of coding experience do you have?

Oops! Something went wrong while submitting the form.

## FREE course on 'Sorting Algorithms' by Omkar Deshpande (Stanford PhD, Head of Curriculum, IK)

Oops! Something went wrong while submitting the form.

# String Compression Problem

Compress a string of alphabetic characters with the basic encoding where you simply count the number of repeated characters.

##### Example One

Input: AAAAA

Output: 5A

Character “A” is repeated 5 times consecutively.

##### Example Two

Input: ABaaaBCC

Output: AB3aB2C

Character “a” is repeated 3 times consecutively, character “C” is repeated 2 times consecutively.

##### Notes

Input Parameters: One string parameter.

Output: Return the compressed string.

Constraints:

• Input string consists of alphabetic characters only

• 1

Solution

We provided one solution for this problem, it is optimal.

The problem asks to encode the input string in such a way so that its length remains the same or decreases. To do so, we counted repeated consecutive characters. If the count was more than one, we replaced the repeated portion by a number followed by the character.

Time complexity:

O(n) where n denotes the length of the input string.

Auxiliary space:

O(1) because no extra memory was used.

Space complexity:

O(n).

### Try yourself in the Editor

Note: Input and Output will already be taken care of.

# String Compression Problem

Compress a string of alphabetic characters with the basic encoding where you simply count the number of repeated characters.

##### Example One

Input: AAAAA

Output: 5A

Character “A” is repeated 5 times consecutively.

##### Example Two

Input: ABaaaBCC

Output: AB3aB2C

Character “a” is repeated 3 times consecutively, character “C” is repeated 2 times consecutively.

##### Notes

Input Parameters: One string parameter.

Output: Return the compressed string.

Constraints:

• Input string consists of alphabetic characters only

• 1

Solution

We provided one solution for this problem, it is optimal.

The problem asks to encode the input string in such a way so that its length remains the same or decreases. To do so, we counted repeated consecutive characters. If the count was more than one, we replaced the repeated portion by a number followed by the character.

Time complexity:

O(n) where n denotes the length of the input string.

Auxiliary space:

O(1) because no extra memory was used.

Space complexity:

O(n).

## Worried About Failing Tech Interviews?

Attend our free webinar to amp up your career and get the salary you deserve.

Hosted By
Ryan Valles
Founder, Interview Kickstart
Accelerate your Interview prep with Tier-1 tech instructors
360° courses that have helped 14,000+ tech professionals
100% money-back guarantee*