This backtracking question combines 4 patterns in one. (and Bloomberg is known for asking it) Given a 2-D grid of characters `board` and a string `word`, return true if `word` is present in the grid, ...

You must first learn trees before you learn: - Backtracking - Graphs - Implicit Graphs Because once you learn trees, everything after stops feeling random. Here's the order we recommend: 1) Binary ...

To find all unique combinations of candidates that sum to a target value, we can use a backtracking approach. However, to avoid duplicate combinations, we need to make sure that we don't consider the ...

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. Intuition: To find all possible letter ...