Recursive String Permutations | Dataford Interview Questions

How do you find all permutations of a given string using recursion?

Implement find_permutations(s), returning all unique permutations as a list of strings in lexicographic order. For repeated characters, do not return duplicate permutations. Return [""] for an empty string.

Constraints

0 <= len(s) <= 8
The input contains printable characters
The output must contain unique permutations in lexicographic order

Function Signature

def find_permutations(s):

Your question is Recursive String Permutations. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

How do you find all permutations of a given string using recursion?

Constraints

0 <= len(s) <= 8
The input contains printable characters
The output must contain unique permutations in lexicographic order

Function Signature

def find_permutations(s):

Your question is Recursive String Permutations. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.