Available question text
Split n into exactly k positive integers whose product equals n while minimizing the difference between the largest and smallest part. The core challenge is to distribute n's prime factors across k multiplicative buckets to balance the values (k is small, so search/backtracking over factor assignments is feasible).
Related questions
Continue with questions that share topics or the same question type.
- Balanced Binary Tree
Coding · Binary Tree · Depth-First Search · Tree
- Calculate Worst-Case Load Factor for Each Service in a DAG
Coding
- Check Balanced String
Coding
- Count Number of Balanced Permutations
Coding
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 3669. Balanced K-Factor Decomposition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source