368. Largest Divisible Subset

https://leetcode.com/problems/largest-divisible-subset/

class Solution:
    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
        subsets = {-1 : set()}
        nums.sort()
        for num in nums:
            subsets[num] = max([subsets[prev] for prev in subsets if num % prev == 0],key=len) | {num}
        return max(subsets.values(),key=len)