Permutations
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

30:00

Permutations
medium
Topics
Companies

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Example 1:
Input: [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Constraints:

  • 1≤nums.length≤61 \leq \text{nums.length} \leq 6

  • −10≤nums[i]≤10-10 \leq \text{nums}[i] \leq 10

  • All integers of nums are unique.

Input
arr =[1,2,3]

Check length: 0 == 3

Candidates

1

2

3

Current Combination

Empty

Sum: 0
Found Solutions
Variables
No variables to display
DepthFunction Call
Stack empty
0/96