Given an array of strings words, return true if it forms a valid word square, or false otherwise.

A sequence of strings forms a valid word square if the $k^{th}$ row and $k^{th}$ column read the exact same string for every valid index $k$. Specifically, the string formed by reading the characters of the $k^{th}$ column from top to bottom must be identical to the $k^{th}$ string in words.

Constraints:

• $1 \leq$ words.length $\leq 500$

• $1 \leq$ words[i].length $\leq 500$

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

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.