developer-roadmap/roadmaps/leetcode/content/permutations@-9-5g5Qyb3JiSwEfabmRD.md

Permutations

Given an array of distinct integers, return all possible orderings. Unlike subsets, order matters here, so at each step you pick any unused element and continue recursively. This problem teaches you the difference between combination-style and permutation-style backtracking, and how to track which elements have been used.

Visit the following resources to learn more:

• @article@Permutations
• @video@Permutations (LeetCode 46) | Full solution with backtracking examples
• @video@Permutations - Leetcode 46 - Recursive Backtracking (Python)