Given an m × n array of characters, and a list of strings.
Return the subset of the strings that are found in the array.
Example:
Grid:
[
['a', 'b', 'c'],
['d', 'e', 'f']
]
Strings:
['abe', 'xyz', 'abf']
Return:
['abe']You are given a character grid and a list of candidate words.
Your task is to return all words that can be formed by tracing adjacent cells in the grid (typically up, down, left, right). Each word must follow character order and cannot reuse the same cell twice.
This is essentially Word Search for multiple words.
A standard solution uses DFS for each word or a Trie to optimize search.
The VOprep team has long accompanied candidates through various major company OAs and VOs, including SnowFlake, Google, Amazon, Citadel, SIG, providing real-time voice assistance, remote practice, and interview pacing reminders to help you stay smooth during critical moments. If you are preparing for these companies, you can check out our customized support plans—from coding interviews to system design, we offer full guidance to help you succeed.
