Print All Name Permutations | Dataford Interview Questions

Write an algorithm to print all permutations of your name.

Implement permutations(name) to return all unique permutations of the input string in lexicographic order. Repeated characters must not produce duplicate permutations. Return a list of strings, including [""] when the input is empty.

Constraints

0 <= len(name) <= 9
name contains printable characters
The output must contain each unique permutation exactly once
Return permutations in lexicographic order

Function Signature

def permutations(name):

Your question is Print All Name 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

Write an algorithm to print all permutations of your name.

Constraints

0 <= len(name) <= 9
name contains printable characters
The output must contain each unique permutation exactly once
Return permutations in lexicographic order

Function Signature

def permutations(name):

Your question is Print All Name 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.