✅ || python || clean solution
\nclass Solution:\n    def largestDivisibleSubset(self, nums):\n        \n     \n        n= len(nums)\n        \n        if n==0:return []\n        \n        nu
```\nclass Solution:\n    def largestDivisibleSubset(self, nums):\n        \n     \n        n= len(nums)\n        \n        if n==0:return []\n        \n        nums.sort()\n        \n        dp=[ [i] for i in nums]\n        \n        for i in range(n):\n            for j in range(i):\n                \n                if nums[i]%nums[j]==0 and len(dp[j])+1 > len(dp[i]):\n                    \n                    dp[i] = dp[j]+[nums[i]]\n        \n        return max(dp, key=len)\n```
['Python', 'Python3']