Permutations

Medium Solved

Description

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

Input format / Clarification:

To simplify execution in this environment, input is provided as a single JSON array representing nums.

Examples

Input: [1,2,3]

Output:

[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Input: [0,1]

Output: [[0,1],[1,0]]

Input: [1]

Output: [[1]]

Important Notes:

  • All integers in nums are unique.
  • Order of permutations does not matter.
  • Output must be printed as a valid JSON array.

Algorithm Hint:

This problem is commonly solved using backtracking / recursion by building permutations step-by-step and tracking used elements.

No submissions yet.

Discuss recursive backtracking, swapping techniques, iterative generation, and time complexity O(n × n!).

Test Cases