Watch 10 video solutions for Minimum Factorization, a medium level problem involving Math, Greedy. This walkthrough by NeetCode has 385,124 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given a positive integer num, return the smallest positive integer x whose multiplication of each digit equals num. If there is no answer or the answer is not fit in 32-bit signed integer, return 0.
Example 1:
Input: num = 48 Output: 68
Example 2:
Input: num = 15 Output: 35
Constraints:
1 <= num <= 231 - 1