Distinct Permutations
Intermediate
Return every different arrangement (permutation) of the characters of s, as strings, in alphabetical (lexicographic) order. If s has repeated characters, an arrangement that looks the same must be listed only once.
Examples
Example 1
Input:
distinct_permutations('abc')
Output:
['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
Example 2
Input:
distinct_permutations('aab')
Output:
['aab', 'aba', 'baa']
Constraints
0 <= len(s) <= 8scontains only lower-case letters.
Theory
Go to TheoryKeywords
dsa-sheetbasicspython-toolbox
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.