42. Permutations

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

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

Explanation: All possible orderings of the numbers 1, 2, and 3 are generated.

Example 2:

Input: nums = [0, 1]

Output: [[0, 1], [1, 0]]

Explanation: All possible orderings of the numbers 0 and 1 are generated.

Example 3:

Input: nums = [1]

Output: [[1]]

Explanation: The only possible ordering of the number 1 is itself.

Constraints:

•
•
•

Time Complexity

O(n!)

Space Complexity

O(n)

42. Permutations

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

42. Permutations

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases