Coding - Permutations

Problem Statement

Permutations

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

Constraints

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

Examples

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,1,2] Output: [[1,1,2],[1,2,1],[2,1,1]]

Hints

• You may use backtracking to solve this problem.

Source

• LeetCode Problem Page
• DarkInterview