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.