Word Match - Find All Dictionary Words Present in a Grid of Letters

Problem Given an m x n grid of characters and a list of dictionary words, find all words that can be formed by traversing adjacent cells (up/down/left/right/diagonal). Each cell may be used at most once per word. Example: Approach Build a trie from the word list. DFS from each cell, traversing the trie simultaneously. Prune paths not in the trie. Mark cells visited during a path; unmark on backtrack. Time: O(mn4^L) where L = max word length, but trie pruning cuts it drastically in practice. Foll…