Given a collection of distinct integers, write a program to return all possible permutations.
Example
Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]| Topic | Difficulty | Companies |
|---|---|---|
| Backtracking |
Medium
|
Microsoft
Adobe
Google
|
Given a collection of distinct integers, write a program to return all possible permutations.
Example
Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
