Backtracking pattern
Permutations
Given an array of distinct integers, return all possible orderings (permutations) of the array, in any order. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 46
- Medium
- 1 approach
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
BacktrackingLeetCode 46
Medium
The approach
- 01 Backtracking · choose an unused element at each level O(n · n!)O(n) space
What you will learn
- How to read Permutations and spot the backtracking pattern in it
- Backtracking · choose an unused element at each level: O(n · n!) time, O(n) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Backtracking
See Permutations run, step by step
Sign in and this page opens on the animation, with all 8 Backtracking problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.