Given an integer array data representing a sequence of bytes, determine whether it is a valid UTF-$8$ encoding.

A character in UTF-$8$ can be from $1$ to $4$ bytes long, following these rules:

• For a $1$ byte character, the first bit is $0$, followed by its Unicode code.

• For an $n$ byte character where $n > 1$, the first $n$ bits are all $1$, the $(n + 1)$th bit is $0$, followed by $n - 1$ continuation bytes. Each continuation byte must have its most significant $2$ bits set to $10$.

Note: Only the least significant $8$ bits of each integer in data are considered.

Constraints:

• $1 \leq$ data.length $\leq 2 imes 10^4$

• $0 \leq$ data[i] $\leq 255$

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.