C# || How To Generate Permutations From Array With Distinct Values Using C#

Print Friendly, PDF & Email

The following is a module with functions which demonstrates how to generate permutations from an array with distinct values using C#.


1. Permute – Problem Statement

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


2. Permute – Solution

The following is a solution which demonstrates how to generate permutations from an array with distinct values.

QUICK NOTES:
The highlighted lines are sections of interest to look out for.

The code is heavily commented, so no further insight is necessary. If you have any questions, feel free to leave a comment below.

Once compiled, you should get this as your output for the example cases:


[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
[[0,1],[1,0]]
[[1]]

Was this article helpful?
👍 YesNo

Leave a Reply