Solution: Permutations

Let's solve the Permutations problem using the Subsets pattern.

We'll cover the following

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≤1 \leq word.length ≤6\leq 6

  • All characters in word are lowercase English letters.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.