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

Solution: Word Search II

Explore how to apply the Trie data structure combined with backtracking to efficiently find multiple words in a 2D grid of letters. Learn to build a prefix tree, perform depth-first search, and reduce search space while handling constraints on grid size and word count.

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
...