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

Solution: Word Search II

Explore how to solve the Word Search II problem by combining trie construction and backtracking. Understand how the trie helps reduce exploration by matching prefixes efficiently while backtracking explores all valid paths in the grid to find given words.

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