Tap here to switch tabs
Problem
Submissions

Problem: Minimum Factorization

Minimum Factorization asks for the smallest positive integer whose individual digits multiply to a given positive number, returning zero if none exists or the result exceeds signed 32-bit range.

Statement

Given a positive integer num, return the smallest positive integer whose individual digits multiply to num. If no such integer can be formed, or if the resulting integer does not fit within a 3232 bit signed integer range, return 00.

Constraints:

  • 1≤1 \leq num ≤231−1\leq 2^{31} - 1

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Factorization

Minimum Factorization asks for the smallest positive integer whose individual digits multiply to a given positive number, returning zero if none exists or the result exceeds signed 32-bit range.

Statement

Given a positive integer num, return the smallest positive integer whose individual digits multiply to num. If no such integer can be formed, or if the resulting integer does not fit within a 3232 bit signed integer range, return 00.

Constraints:

  • 1≤1 \leq num ≤231−1\leq 2^{31} - 1