Solution: Word Search II
Explore how to efficiently solve the Word Search II problem by using a trie to store words and applying depth-first search with backtracking. Understand how tries reduce search space for prefix matching, enabling faster exploration of paths in a 2D grid. This lesson helps you grasp time and space complexity tradeoffs while implementing a solution that finds multiple strings in a letter grid.
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