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

Word Search II

Understand how to employ a Trie to efficiently search for multiple words in a two-dimensional grid of letters. Learn to identify sequentially adjacent cells and implement a solution in C++ to return found words, improving your problem-solving skills 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
...