Solution: Word Search II

Let's solve the Word Search II problem using the Trie pattern.

Statement

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:

  • 11 \leq rows, columns 12\leq 12
...
Access this course and 1400+ top-rated courses and projects.