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

Word Search II

Explore implementing a trie to solve the Word Search II problem, where you find given words in a 2D grid by traversing sequential adjacent cells. This lesson will help you efficiently manage string searches and understand how to apply trie structures 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
...