Permutations
Permutations
Given an array nums containing distinct integers, return all possible permutations of the array. The order of the returned permutations does not matter.
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] <= 10- All integers in
numsare unique.
Similar LeetCode problem: Permutations
AI interview prep
Core dilemma
Generating all combinations/sequences versus ensuring uniqueness and completeness within a constrained search space.
2 tradeoffs and 2 stress tests locked
Interview prep
Unlock the interviewer X-Ray rubric, tradeoff matrix, stress tests, clarifying questions, and key concepts.
Permutations
Permutations
Given an array nums containing distinct integers, return all possible permutations of the array. The order of the returned permutations does not matter.
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] <= 10- All integers in
numsare unique.
Similar LeetCode problem: Permutations