NeetCode #939LC-625MediumMath & Geometry
← Back to All Problems#939 · #625 · Minimum Factorization(最小因式分解)
📌 Problem Statement & Constraints
Given a positive integer
a, find the smallest positive integer b whose digit product equals a. Return 0 if no such b exists or if it exceeds the signed 32-bit range. Constraints: 1 <= a <= 2^31 - 1.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!