Word Search II
Given a 2D grid and 30,000 strings, return all matches formed by adjacent cells without reuse. Use DFS and a Trie to solve this Reddit problem.
Check more interview questions and experiences about Reddit
Given a 2D grid and 30,000 strings, return all matches formed by adjacent cells without reuse. Use DFS and a Trie to solve this Reddit problem.
Check more interview questions and experiences about Reddit
Please log in to view interview question details