solulubeta
Sign in
NeetCode 150 / Tries
08.03 · Problem

Word Search II

Hard Trie + grid backtracking 1 video LC 212 Pro

This problem is part of solulu Pro

Given an m × n grid of lowercase letters and a list of distinct words, return all words that can be formed in the grid. A word is built from letters of horizontally or vertically adjacent cells, and a cell can't be used…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 63 of 150 · updated 2026-10-12