Function dfs

javascript/0046-permutations.js:11–22

(nums, permutation = [], permutations = [])

};

var dfs = function (nums, permutation = [], permutations = []) {
    const isBaseCase = nums.length === permutation.length;
    if (isBaseCase) return permutations.push(permutation.slice());

    for (let i = 0; i < nums.length; i++) {
        if (permutation.includes(nums[i])) continue;

        backTrack(nums, i, permutation, permutations);
    }

    return permutations;
};

const backTrack = (nums, i, permutation, permutations) => {
    permutation.push(nums[i]);