#1998Hard#13 in Snowflake's list· asked at 13 companies
Word Search II
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"] Output: ["eat","oath"]
Example 2
Input: board = [["a","b"],["c","d"]], words = ["abcb"] Output: []
Constraints
- •
m == board.length,n == board[i].length - •
1 <= m, n <= 12 - •
1 <= words.length <= 3 * 10^4 - •
1 <= words[i].length <= 10 - •
All the strings of
wordsare unique.