Try to solve the Permutations problem.


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

Note: The order of permutations does not matter.


  • All characters in word are unique.

  • 11 \leq word.length 6\leq 6

  • All characters in word are lowercase English letters.

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy