Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 254. Factor Combinations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source