factorization

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 625: Minimum Factorization

Problem Restatement We are given a positive integer num . We need to find the smallest positive integer x such that the product of the digits of x equals num . If no such integer exists, return 0 . If the answer does not fit in a 32-bit signed integer, return 0 . The official examples are: num = 48 Output: 68 because: 6 * 8 == 48 Another example:...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 492: Construct the Rectangle

Problem Restatement We are given a positive integer area . We need to find two positive integers: Name Meaning L Length W Width They must satisfy three rules: Rule Meaning L * W == area The rectangle area must match exactly L >= W Length must be at least width L - W is minimized The rectangle should be as close to a square as possible Return: [L, W] The...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 254: Factor Combinations

Problem Restatement We are given a positive integer n . We need to return all possible ways to write n as a product of factors. Each factor must be between 2 and n - 1 . For example: 8 = 2 * 2 * 2 8 = 2 * 4 So for n = 8 , valid answers are: [[2, 2, 2], [2, 4]] We may return the combinations in...

#factorization

LeetCode 625: Minimum Factorization

LeetCode 492: Construct the Rectangle

LeetCode 254: Factor Combinations