You are stacking blocks to construct a pyramid, where each block is represented by a single character. You are given a string bottom, representing the base row of the pyramid, and an array of strings allowed, representing the valid triangular patterns.

For any two adjacent blocks with characters u and v on a given level, a block with character w can be placed directly above them on the next level if and only if the pattern formed by concatenating u, v, and w is present in allowed.

A level with $k$ blocks will lead to a level of $k - 1$ blocks directly above it. The pyramid is successfully completed if you can continue this process until reaching the apex, which consists of a single block of length $1$.

Return true if it is possible to build the pyramid up to the top level, or false otherwise.

Constraints:

• $2 \leq$ bottom.length $\leq 6$

• $0 \leq$ allowed.length $\leq 216$

• allowed[i].length $= 3$

• All characters in bottom and allowed[i] are chosen from the set {'A', 'B', 'C', 'D', 'E', 'F'}.

• All strings in allowed are unique.

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.