Permutations of a Number List | Dataford Interview Questions

Given a list of numbers, return all possible permutations (e.g. nums = [1, 2, 3] -> [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]).

Asked in the Technical Phone Screen stage. Lead Data Engineer, Bangkok, online.

Implement def permute(nums):. The input is a list of distinct integers. Return a list containing every permutation, with each permutation represented as a list. The ordering of the returned permutations does not affect correctness.

Constraints

0 <= len(nums) <= 8
-10^9 <= nums[i] <= 10^9
All values in nums are distinct

Function Signature

def permute(nums):

Your question is Permutations of a Number List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a list of numbers, return all possible permutations (e.g. nums = [1, 2, 3] -> [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]).

Asked in the Technical Phone Screen stage. Lead Data Engineer, Bangkok, online.

Constraints

0 <= len(nums) <= 8
-10^9 <= nums[i] <= 10^9
All values in nums are distinct

Function Signature

def permute(nums):

Your question is Permutations of a Number List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.