Skip to main content
Word Search II | AlgoCracked
AlgoCracked
ProblemsWord Search II
Hard38.0% acceptance
Blind75ArrayTrieBacktrackingMatrix

Word Search II

You are given an m × n board of single-character cells and a list of words . A word is present if its letters can be traced through a path of horizontally or vertically neighbouring cells, where the same cell is used at most once per word. Return every word from words that is present on the board. The words may be returned in any order . Input format Input is [board, words] , e.g. [[[ a , b ],[ c , d ]],[ ab , cd ]] .

Loading workspace…