Leetcode 46. Permutations

Generate all possible orderings of a list of distinct integers — i.e., return every permutation of the array. The challenge is to enumerate all n! arrangements efficiently (n ≤ 6), typically via backtracking or iterative permutation generation.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid January, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 46. Permutations

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact