Permutations — Medium Coding Interview Question

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

Example

Input: nums = [1,2,3]

Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Constraints

• 1 ≤ nums.length ≤ 6
• All integers are unique
• -10 ≤ nums[i] ≤ 10

Topics & Companies

Topics: backtracking, arrays

Asked by: Amazon, Google, Meta, Microsoft, Adobe, Bloomberg

Optimal Solution Complexity

Time complexity: O(n × n!). Space complexity: O(n!).

Practice more

• All DSA Problems
• DSA Patterns