Recursion and backtracking in JavaScript

function permute(nums) {
  const result = [];

  function backtrack(path, remaining) {
    if (remaining.length === 0) {
      result.push([...path]);
      return;
    }

    for (let i = 0; i < remaining.length; i++) {
      const val = remaining[i];
      path.push(val);
      const next = remaining.filter((_, idx) => idx !== i);
      backtrack(path, next);
      path.pop();
    }
  }

  backtrack([], nums);
  return result;
}