Permutations
Updated Jan 31, 2026
Problem
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Constraints
1 <= nums.length <= 6
-10 <= nums[i] <= 10
All the integers of nums are unique.
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]]
Function Signature
def permute(self, nums: list[int]) -> list[list[int]]
How to Submit
Implement a Solution class with a permute method.
Your method will be called with the input parameters and should return the answer.