You are given a list of strings that you need to find in a 2D grid of letters such that the string can be constructed from letters in sequentially adjacent cells. The cells are considered sequentially adjacent when they are neighbors to each other either horizontally or vertically. The solution should return a list containing the strings from the input list that were found in the grid.

Constraints:

• $1 \leq$ rows, columns $\leq 12$
• $1 \leq$ words.length $\leq 3 \times {10^3}$
• $1 \leq$ words[i].length $\leq 10$
• grid[i][j] is an uppercase English letter.
• words[i] consists of uppercase English letters.
• All the strings are unique.

Note: The order of the strings in the output does not matter.

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 main.py in the following coding playground.