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

Solution: Word Search II

Explore how to solve the Word Search II problem by using a trie data structure combined with backtracking and depth-first search. Understand how to reduce search space, explore adjacent cells, and efficiently handle multiple words in a grid. This lesson helps you improve time complexity while managing string searches in coding interviews.

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