Problem · Trie
Word Search II
● Hard
AmazonNEW GRADONSITE INTERVIEW
See Amazon hiring insightsAmazonNEW GRADONSITE INTERVIEWProblem statement
Given an m x n board of lowercase English letters and an array of distinct lowercase words, return every word that can be formed on the board.
A word is formed by starting at any cell and repeatedly moving one cell horizontally or vertically. A board cell may be used at most once while forming one word.
The problem statement continues
ProExamples
Example 1
board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]]words = ["oath","pea","eat","rain"]return = ["oath","eat"]The paths o-a-t-h and e-a-t use horizontal or vertical neighbors without reusing a cell.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week