Uber·Software Engineer·Technical Phone Screen
- Given a 2D board of characters and a list of words, find all words that can be formed by tracing a path through adjacent cells (horizontally or vertically), without reusing any cell in a single word.
“You kind of have to go Trie plus DFS here.”