There are two types of special characters:
The first character is represented by a single bit, $0$.
The second character is represented by two bits, either $10$ or $11$.

Given an array of binary digits bits that terminates with $0$, return true if the final character must be a one bit character, and false otherwise.

Constraints:

• $1 \leq$ bits.length $\leq 1000$

• bits[i] is either $0$ or $1$.

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.