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

Solution: Word Search II

Explore how to solve Word Search II by constructing a trie from given words and using backtracking with depth-first search to efficiently find all listed words in a letter grid. Understand the technique to reduce search space and improve performance by leveraging tries for prefix checks.

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
  • 1≤1 \leq words.length ≤3×
...