Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Word Search II

Explore how to efficiently find multiple words in a 2D letter grid using a combination of the trie data structure and backtracking. Understand how to build a trie from a list of words, perform depth-first search with pruning, and reduce the search space to improve time complexity when solving the Word Search II problem.

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:

  • 1≤1 \leq rows, columns ≤12\leq 12
...