Solution: Word Search II
Explore how to solve the Word Search II problem using a trie for efficient prefix matching combined with backtracking. This lesson helps you understand how to construct the trie from given words, perform depth-first search across a letter grid, and optimize search paths to find words efficiently. You'll learn to implement this approach and evaluate its time and space complexities.
We'll cover the following...
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:
- rows, columns