Permutations

Backtracking, problem 3 of 7

Permutations

Medium

LC #46

permutations

Not attempted yet

Given a list nums of distinct integers, return every possible ordering (permutation) of it. Return the permutations in any order.

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 ≤ len(nums) ≤ 6
  • -10 ≤ nums[i] ≤ 10
  • All numbers are distinct.

Python

Loading draft…

Test results

7 tests available

No results yet

Run tests your code against the examples; Submit runs the hidden tests too.

3 examples, 4 hidden

Run examples, then submit all tests.