Word Search II - JavaScript Coding Challenge

Given a board and words, find all words present in the board.

[["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], ["oath","pea","eat","rain"]

["oath","eat"]

Example 2

Input

board = [   ["a","a"] ];  words = ["aa"];

Output

["aa"]

Explanation

You can form "aa" by using the first and second cell in the top row.

Hint 1

Build trie of words for efficient search

Hint 2

Use DFS to explore board

Hint 3

Mark visited cells to avoid reuse

Code Editor

Loading question...