Problem Statement:

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies:
Si % Sj = 0 or Sj % Si = 0.
If there are multiple solutions, return any subset is fine.

Example 1:
Input: [1,2,3]
Output: [1,2] (of course, [1,3] will also be ok)

Example 2:
Input: [1,2,4,8]
Output: [1,2,4,8]


Detailed Algorithm Discussion:

Login to Access Content

Java Code:

Login to Access Content

Python Code:

Login to Access Content

Other related chapters:


If you have any feedback, please use this form:

Help Your Friends save 25% on our products