Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. 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]Output: [[1]] Constraints:1 <= nums.length <= 6-10 <= nums[i] <= 10All the integers of nums are unique.

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

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1].The next permutation of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).For example, the next permutation of arr = [1,2,3] is [1,3,2].Similarly, the next permutation of arr = [2,3,1] is [3,1,2].While the next permutation of arr = [3,2,1] is [1,2,3] because [3,2,1] does not have a lexicographical larger rearrangement.Given an array of integers nums, find the next permutation of nums.The replacement must be in place and use only constant extra memory. Example 1:Input: nums = [1,2,3]Output: [1,3,2]Example 2:Input: nums = [3,2,1]Output: [1,2,3]Example 3:Input: nums = [1,1,5]Output: [1,5,1] Constraints:1 <= nums.length <= 1000 <= nums[i] <= 100

PermutationWrite a C function that takes an array of digits representing a number and returns a 2D array containing all possible permutations of the digits.For example, given the array [1, 2, 3], the function should return a 2D array containing the following permutations: [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]].Testcase:Input:1 2 3Output:1 2 3 1 3 2 2 1 3 2 3 1 3 2 1 3 1 2

Given an n-digit number(all digits are unique), write a working  code to generate permutations of all numbers possible using one or more digits from the input number.Eg: Input: 123Output:123121321233132123132213231312321

Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.You must write an algorithm that runs in O(n) time and uses only constant extra space. Example 1:Input: nums = [4,3,2,7,8,2,3,1]Output: [2,3]Example 2:Input: nums = [1,1,2]Output: [1]Example 3:Input: nums = [1]Output: [] Constraints: