Solution: Permutations
Let's solve the Permutations problem using the Subsets pattern.
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. -
word.length
-
All characters in
word
are lowercase English letters.