Available question text
For each query (n, k), count n-length positive integer arrays whose product is k by prime-factorizing k and using stars-and-bars to distribute each prime's exponents across the n positions; the answer is the product of those binomial counts taken modulo 1e9+7.
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 1735. Count Ways to Make Array With Product
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source