# Count Ways To Make Array With Product: Interview Notes

Count Ways To Make Array With Product shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

queries (n, k): number of arrays of n positive ints whose product is k. Factorize k; for each prime exponent e, the number of ways to split e indistinguishable items into n (possibly empty) bins is C(e+n-1, n-1). Multiply over primes (stars and bars). Precompute factorials for n, e up to limits.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(sqrt(k) + log) per query after factorial prep.

## Common mistake

Treating the factorization as ordered tuples without stars-and-bars, or forgetting empty bins (1s in the array).

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI copilot.