Loading…
Word Search II is a hard coding interview question covering trie, backtracking, strings, graphs — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Given an m x n grid of characters and a list of words, return every word that can be spelled by walking horizontally or vertically adjacent cells, without using the same cell twice in one word. Example: board [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]] with words ["oath","pea","eat","rain"] returns ["oath","eat"].
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.