Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Kotlin: Real-World Examples

DIY: String Compression

Explore how to compress a list of characters in place using a linear algorithm that handles consecutive repeats and returns the new compressed length. Understand techniques to optimize space and apply this to coding interview problems.

We'll cover the following...

Problem statement

You are given a list of characters. Your task will be to compress this list, using the following algorithm:

For each group of consecutive repeating characters in the string:

  1. If the group’s length is 1, you will append the character to s.
...