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

Word Search II

Explore how to use trie data structures to efficiently locate multiple words within a 2D grid of letters. Learn to implement algorithms that navigate horizontally and vertically adjacent cells to identify words from a list, enhancing your problem-solving skills for 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
...