🙏

জয়  শ্রী  রাম

🕉

---

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]

Solution:

Detailed Algorithm Discussion:

Login to Access Content

Java Code:

Login to Access Content

Python Code:

Login to Access Content

Other related chapters:

• Core Concept
• Box Stacking
• Russian Doll Envelopes
• Longest String Chain
• Best Team with No Conflict
• Longest Bitonic Subsequence

Instructor: