Leetcode 254. Factor Combinations

Given an integer n, return all unique combinations of integers greater than 1 (and less than n) whose product equals n, with factors in non-decreasing order to avoid duplicate permutations. This is typically solved by backtracking/DFS exploring possible divisors (often up to sqrt(remaining) and adding complementary factors) to build factor combinations.