Add solution #46

Author: JoshCrozier

README.md

@@ -39,6 +39,7 @@
 41|[First Missing Positive](./0041-first-missing-positive.js)|Hard|
 42|[Trapping Rain Water](./0042-trapping-rain-water.js)|Hard|
 43|[Multiply Strings](./0043-multiply-strings.js)|Medium|
+46|[Permutations](./0046-permutations.js)|Medium|
 49|[Group Anagrams](./0049-group-anagrams.js)|Medium|
 50|[Pow(x, n)](./0050-powx-n.js)|Medium|
 53|[Maximum Subarray](./0053-maximum-subarray.js)|Easy|
@@ -216,4 +217,4 @@
 
 [MIT License](https://opensource.org/licenses/MIT)
 
-Copyright (c) 2019-2021 [Josh Crozier](https://joshcrozier.com)
+Copyright (c) 2019-2022 [Josh Crozier](https://joshcrozier.com)

solutions/0046-permutations.js

@@ -0,0 +1,32 @@
+/**
+ * 46. Permutations
+ * https://leetcode.com/problems/permutations/
+ * Difficulty: Medium
+ *
+ * Given an array nums of distinct integers, return all the possible permutations.
+ * You can return the answer in any order.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var permute = function(nums) {
+  const result = [];
+  backtrack(result, nums);
+  return result;
+};
+
+function backtrack(result, nums, order = []) {
+  if (!nums.length) {
+    result.push(order);
+  } else {
+    for (let i = 0; i < nums.length; i++) {
+      backtrack(
+        result,
+        [...nums.slice(0, i), ...nums.slice(i + 1)],
+        [...order, nums[i]]
+      );
+    }
+  }
+}