Output All Permutations | Dataford Interview Questions

Output all permutations of size n.

Implement def generate_permutations(n): to return every permutation of [1, 2, ..., n] exactly once, in lexicographic order. Return a list of lists; for n = 0, return [[]].

Examples: n = 3 returns [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]; n = 1 returns [[1]].

Constraints: 0 <= n <= 8; the output contains exactly n! permutations.

Constraints

0 <= n <= 8
The values to permute are exactly [1, 2, ..., n]
Return all permutations exactly once
The output must be in lexicographic order
For n = 0, return [[]]

Function Signature

def generate_permutations(n):

Your question is Output 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