Largest Divisible Subset
Medium
You receive a set of distinct positive integers nums, provide the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:
-
answer[i] % answer[j] == 0, or -
answer[j] % answer[i] == 0
If there are multiple solutions, provide any of them.
Example 1
Input: nums = [1,2,3]
Output: [1,2]
Explanation: [1,3] is also accepted.
Example 2
Input: nums = [1,2,4,8]
Output: [1,2,4,8]
Constraints
1 <= nums.length <= 10001 <= nums[i] <= 2 * 10^9- All the integers in
numsare unique.
Did this problem appear in one of your interviews?
Responses stay private.