DIY: Word Search II
Explore how to implement a word search algorithm that finds given strings in a 2D grid of characters using only up, down, left, and right neighbors. Understand how to optimize the search with a Trie data structure and return found words from the input list.
We'll cover the following...
We'll cover the following...
Problem statement
In this challenge, you will be given a list of strings that you need to find in the 2D grid. Neighboring characters can be combined to form strings. Remember that the diagonals are not included in neighboring characters; only up, down, right, and left neighbors can be considered. The ...