You are given a string s consisting of digits from $'1'$ to $'9'$.

A pair of adjacent characters in s is considered valid if:

• The two adjacent characters are not equal.

• The total count of each character in s is equal to its numeric value.

Return the first valid pair of adjacent characters encountered from left to right. If no valid pair exists, return an empty string "".

Constraints:

• $2 \leq$ s.length $\leq 100$

• s consists only of digits from $'1'$ to $'9'$.

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.