# Python code to demonstrate permutations
import itertools as it
 
print(list(it.permutations(['g', 'e', 'k'])))

Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

class Solution { /** * @param Integer[] $nums * @return Integer[][] */ function permute($nums) { }
}

class Solution { public List<List<Integer>> permute(int[] nums) { }
}

function permute(nums: number[]): number[][] {
};

/** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). */
int** permute(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
}

from itertools import permutations
from itertools import combinations
p = permutations([1,2,4]) # or permutations([1, 2, 3], 2)
for i in p: print(i)
c = combinations([1,2,3],2)
for j in c: print(j) 

public class Solution { public IList<IList<int>> Permute(int[] nums) { }
}

/** * @param {number[]} nums * @return {number[][]} */
var permute = function(nums) {
};

class Solution { func permute(_ nums: [Int]) -> [[Int]] { }
}