Permutations · Interview Problem

Leetcode

permutations

Medium

Backtracking

Recursion

Depth-First Search

Permutations

Generate all possible permutations of a list of distinct integers.

Acceptance 100%

Problem Statement

Core description from the backend problem record.

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

An array of distinct integers nums.

A list of arrays representing all possible permutations of nums.

1 <= nums.length <= 6 -10 <= nums[i] <= 10

Examples

Sample cases returned by the problem API.

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]]

Explanation

All permutations of the array [1,2,3].

Loading Preptin