Skip to content

problem5.md

Latest commit

 

History

History
15 lines (11 loc) · 417 Bytes

problem5.md

File metadata and controls

15 lines (11 loc) · 417 Bytes

Problem 5: The Arrangement Engine (Permutations)

Problem Statement

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

Input Format

  • An array of distinct integers nums.

Constraints

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

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