Solution: Word Search II
Explore how to apply a trie data structure combined with backtracking to efficiently find multiple words in a 2D grid of letters. This lesson demonstrates building a trie for prefix matching, then using depth-first search to locate words while optimizing time complexity. Understand the balance between search strategies and data structure use to solve the Word Search II problem effectively.
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