Leetcode 212. Word Search II
Given an m×n letter grid and a list of words, find all words that can be formed by sequentially adjacent (horizontal/vertical) non-repeating cells. The core challenge is efficiently searching many candidate words on the board using DFS/backtracking with prefix pruning (e.g., a Trie) to handle up to 12×12 boards and tens of thousands of words.
Asked at:
Glean
Uber
Snowflake
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late April, 2026
Uber
Senior
Problem is similar or even identical to Leetcode, except the interviewer stressed emphasis on solving it via graphs instead of the trie approach.
Early April, 2026
Glean
Senior
Late November, 2025
Bloomberg
Senior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.