0212 - Word Search II

[mkiglics]

Description of the Problem

Given a 2D board and a list of words from the dictionary, find all words in the board.

Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. Example:

Input: 
board = [
  ['o','a','a','n'],
  ['e','t','a','e'],
  ['i','h','k','r'],
  ['i','f','l','v']
]
words = ["oath","pea","eat","rain"]

Output: ["eat","oath"]

Note:

All inputs are consist of lowercase letters a-z. The values of words are distinct.

Link To The LeetCode Problem

LeetCode

[mkiglics]

I would like to solve this

[reach-the-sky]

I would like to solve it please assign it to me.

[vJechsmayr]

@mkiglics Waiting for your PR 😸