Permutations

The problem Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. A permutation is a rearrangement of all the elements of an array. Examples Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Input: nums = [0,1] Output: [[0,1],[1,0]] Input: nums = [1] Output: [[1]] Constraints 1 <= nums.length <= 6 -10 <= nums[i] <= 10 All the integers of nums are unique. Explanation From the description of the problem we learn that we need to return all possible permutations from an array of distinct integer values. ...