Back to Questions

Word Search II (Trie & Backtracking)

116.5K viewsAsked at Cisco
Hard

Question Explain

Given a 2D board and a list of words, find all words on the board. The approach must leverage a Trie for efficient prefix matching during Backtracking.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question