Given an array of characters, chars, compress it in place according to the following rules:

1. Start with an empty string s.

2. For each group of consecutive repeating characters in chars:

   1. If the group length is $1$, append just the character to s.

   2. Otherwise, append the character followed by the group length.

The compressed string s should not be returned separately; instead, it must be written directly into the input character array chars. Note that if a group’s length is $10$ or greater, each digit of the length should be stored as a separate character in chars.

After modifying the array, return the new length of the compressed array.

Note: Your solution must use only constant extra space. Any characters beyond the returned length in chars can be ignored.

Constraints:

• $1 \leq$ chars.length $\leq 2000$

• chars[i] is a lowercase English letter, an uppercase English letter, a digit, or a symbol.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.