Generate All Permutations of a String |
Interview Question

Generate All Permutations

Course launching November 17, 2020

Follow me on YouTube for free coding interview videos.

Users who sign up for the email list will receive an exclusive 75% discount at launch.

Your subscription could not be saved. Please try again.
Your subscription was successful! 🤓


Write a function generatePermutations that finds all the of an input string.

  • If there are duplicate letters, you should include the duplicate permutations of each.
  • Time and space complexity is not considered for the quality of the solution - focus on readable code.
// ['dev', 'dve', 'edv', 'evd', 'vde', 'ved']

// Notice you include duplicate permutations if there are duplicate letters
// ['bob', 'bbo', 'bob', 'bbo', 'obb', 'obb']
Interactive Permutation Animation

Validate My Answer

  1. Our constraint says that the Big O complexity should not be factored into picking a solution. You will likely want to use recursion because the iterative solution is painfully long.

  2. Duplicate strings are allowed in the result if they form the same permutation. You only need to focus on creating the logic for the permutations without needing to validate.

  3. Any recursive solution must have a base case. Think through what it would be here and ensure it's included in your solution.