Given an array of strings words where each word has a length of $4$, find all valid word squares that can be formed using four words: top, left, right, and bottom.

A word square is valid if it satisfies the following corner constraints:

• top[0] == left[0] (top left corner)

• top[3] == right[0] (top right corner)

• bottom[0] == left[3] (bottom left corner)

• bottom[3] == right[3] (bottom right corner)

Return all valid word squares as a list of lists of strings, where each square is represented in the order [top, left, right, bottom]. The results may be returned in any order.

Constraints:

• $4 \leq$ words.length $\leq 15$

• words[i].length $== 4$

• words[i] consists of only lowercase English letters.

• All words[i] are distinct.

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.