Learn and practice the Backtracking and Subsets patterns to solve coding interview problems.

Educative-99 in JavaScript: Accelerate Your Coding Interview Prep

The optimal solution to certain problems requires examining all possibilities. If any possibility is ignored, we are unable to say with mathematical certainty that our solution is optimal. In such situations, we use a technique known as backtracking to exhaustively traverse the entire solution space and collect all the information needed to compute the optimal solution. The Subsets pattern groups together those problems where we need to systematically construct all, or, a mathematically defined subset of all, the possible subsets of a given set. Again, the technique used for the construction of such a set of subsets is, in fact, backtracking.

Go With the Flow

# Statement

Given an input string, `word`, return all possible permutations of the string.

> **Note:** The order of permutations does not matter. 

**Constraints:**

* All characters in `word` are unique.

* $1 \leq$ `word.length` $\leq 6$
* All characters in `word` are lowercase English letters.

# Examples

Backtracking

Subsets

Conclusion

Permutations

Statement