โ† Soroco questions

Minimum Digits for Product

Filed under Soroco

The question

Given an integer n, find the minimum number of digits whose product equals n, or print -1 if impossible. Expected complexity O(log n).

No write-up yet. Related questions below have one.

Related Soroco questions

Collected from public candidate posts and coding forums. Updated Nov 2026.