Back to Questions

Word Search II (Trie & Backtracking)

116.6K views•Asked 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

Other interview questions like this

Reverse a Linked List

46.1K views

Kth Smallest Element in a BST

94.9K views

Lowest Common Ancestor of a BST

74.9K views
Word Search II (Trie & Backtracking) - Interview Question