Practice Permutations
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Source: Permutations on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,2,3]
Output
[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
# Example 2
Input
nums = [0,1]
Output
[[0,1],[1,0]]
# Example 3
Input
nums = [1]
Output
[[1]]
Constraints
1 <= nums.length <= 6
-10 <= nums[i] <= 10
All the integers of nums are unique.
Related LeetCode Problems
Practice more problems similar to Permutations.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.