Print All Permutations | Dataford Interview Questions

Print all permutations of a given string using recursion.

Asked in the senior managerial round stage.

Implement permutations(s), where s is a string. Return a list containing each distinct permutation exactly once, in depth-first backtracking order. For an empty string, return [].

Constraints

0 <= len(s) <= 8
Characters may repeat
Return each distinct permutation exactly once
Return [] when s is empty

Function Signature

def permutations(s):

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