Permutation

Medium

Permutation

Backtracking algorithm to generate all orderings of n elements

BacktrackingPermutationRecursion

A permutation is an arrangement of r elements selected from n elements in a specific order. Different orders are treated as different permutations.

1/35

Count all possible orderings of 3 elements. Let's find all permutations of [1, 2, 3]! There are 3! = 6 permutations in total!

🔒

Medium

Permutation

Backtracking algorithm to generate all orderings of n elements

BacktrackingPermutationRecursion

A permutation is an arrangement of r elements selected from n elements in a specific order. Different orders are treated as different permutations.

1/35

Count all possible orderings of 3 elements. Let's find all permutations of [1, 2, 3]! There are 3! = 6 permutations in total!

🔒