## Leetcode - 212. Word Search II

Algorithms, Backtracking, Trie

## Problem Statement

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

Read MoreRamblings and teachings on topics of interest to me.

Algorithms, Backtracking, Trie

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

Read MoreAlgorithms, Array, Backtracking, DFS

Given a 2D board and a word, find if the word exists in the grid.

Read MoreAlgorithms, Backtracking, Recursion, String, Leetcode

Before we start solving this problem, let’s do some math first. The problem statement clearly states that we have *N* pairs of parentheses to work with. That means for a string to be considered as part of the solution, it must be of size *2N*.