Back to Questions

Word Search (Trie & Backtracking)

65.9K views•Asked at Uber•
Medium

Question Explain

Given a 2D board and a word, determine if the word exists in the grid. Model the problem as a graph traversal and use an efficient pruning technique (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

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

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