Search⌘ K
AI Features

DIY: String Compression

Explore how to perform string compression by grouping consecutive characters and encoding their counts directly in the original array. Understand how to maintain constant space complexity and return the updated length after compression.

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
...