Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Vote For New Content
Mohammed Dh Abbas
My solution

Mohammed Dh Abbas

Sep 17, 2024

from math import sqrt class Solution: def getFactors(self, n): def get_number_factors(): factors = set() for i in range(2, int(sqrt(n)) + 1): if n % i == 0: factors.add(i) factors.add(n / i) return list(factors) def backtrack(result, path, mpy, factors, index): if mpy > n: return if mpy == n and len(path) > 0: result.append(path[:]) return for i in range(index, len(factors)): mpy *= factors[i] path.append(factors[i]) backtrack(result, path, mpy, factors, i) path.pop() mpy /= factors[i] result = [] factors = get_number_factors() backtrack(result, [], 1, factors, 0) return result

0

0

Comments
Comments

On this page