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

Solution: Word Search II

Explore the solution to Word Search II by learning how to use the trie data structure alongside backtracking to efficiently find multiple words in a letter grid. Understand how prefix matching reduces search space and how depth-first search explores all possible paths to confirm word presence.

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