You are given an alphanumeric string s consisting of lowercase English letters and digits.

Rearrange the characters of s such that no two adjacent characters have the same type, meaning no two letters are adjacent and no two digits are adjacent.

Return the reformatted string. If it is impossible to reorder the characters to satisfy this condition, return an empty string "".

Constraints:

• $1 \leq$ s.length $\leq 500$

• s consists of only lowercase English letters and digits.

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