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

Word Search II

Explore how to implement and use trie data structures to efficiently find multiple words in a 2D grid of letters. Learn to navigate adjacency constraints and return found words while optimizing your solution for coding interviews. This lesson helps you grasp practical trie applications for string search challenges.

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