Permutations
Last updated
What is 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.
Free resources to learn Permutations
More in stage 12: Backtracking
Permutations: common questions
Can I learn Permutations in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Permutations in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Permutations tutorial for beginners?
It is lesson 71 of 137 in the free LeetCode roadmap, in stage 12, Backtracking. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.