Add solution #254

JoshCrozier · JoshCrozier · commit b6b62b7af6bd · 2025-06-10T22:29:20.000-05:00
diff --git a/README.md b/README.md
@@ -243,6 +243,7 @@
 251|[Flatten 2D Vector](./solutions/0251-flatten-2d-vector.js)|Medium|
 252|[Meeting Rooms](./solutions/0252-meeting-rooms.js)|Easy|
 253|[Meeting Rooms II](./solutions/0253-meeting-rooms-ii.js)|Medium|
+254|[Factor Combinations](./solutions/0254-factor-combinations.js)|Medium|
 257|[Binary Tree Paths](./solutions/0257-binary-tree-paths.js)|Easy|
 258|[Add Digits](./solutions/0258-add-digits.js)|Easy|
 260|[Single Number III](./solutions/0260-single-number-iii.js)|Medium|
diff --git a/solutions/0254-factor-combinations.js b/solutions/0254-factor-combinations.js
@@ -0,0 +1,36 @@
+/**
+ * 254. Factor Combinations
+ * https://leetcode.com/problems/factor-combinations/
+ * Difficulty: Medium
+ *
+ * Numbers can be regarded as the product of their factors.
+ *
+ * For example, 8 = 2 x 2 x 2 = 2 x 4.
+ *
+ * Given an integer n, return all possible combinations of its factors. You may return the
+ * answer in any order.
+ *
+ * Note that the factors should be in the range [2, n - 1].
+ */
+
+/**
+ * @param {number} n
+ * @return {number[][]}
+ */
+var getFactors = function(n) {
+  const result = [];
+  findFactors(n, 2, []);
+  return result;
+
+  function findFactors(currentNum, start, combination) {
+    for (let i = start; i * i <= currentNum; i++) {
+      if (currentNum % i === 0) {
+        const nextNum = currentNum / i;
+        if (nextNum >= i && nextNum < currentNum) {
+          result.push([...combination, i, nextNum]);
+          findFactors(nextNum, i, [...combination, i]);
+        }
+      }
+    }
+  }
+};
