Search
⌘K
Get Premium
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:
Amazon
Bloomberg
Snowflake
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late November, 2025
Bloomberg
Senior
Mid October, 2025
Intern
Same as the leetcode version, just that you can search along the diagonals too.
Mid July, 2025
Snowflake
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.