Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 254 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 254 # by problem number
lcpy gen -s factor_combinations # by problem name
8 = 2 x 2 x 2 = 2 x 4.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].
Input: n = 1
Output: []
Input: n = 12
Output: [[2,6],[3,4],[2,2,3]]
Input: n = 37
Output: []
1 <= n <= 10^7class Solution:
# Time: O(sqrt(n)^d) where d is the max factorization depth
# Space: O(d)
def get_factors(self, n: int) -> list[list[int]]:
results: list[list[int]] = []
path: list[int] = []
def dfs(remaining: int, start: int) -> None:
if path:
results.append([*path, remaining])
for factor in range(start, int(remaining**0.5) + 1):
if remaining % factor == 0:
path.append(factor)
dfs(remaining // factor, factor)
path.pop()
dfs(n, 2)
return results
| Time | Space |
|---|---|
| O(sqrt(n)^d) where d is the max factorization depth | O(d) |