✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)Code #1.1 - OnelinerCode #1.2 - UnwrappedRef(Disclai
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

## Code #1.1 - Oneliner
```python3
class Solution:
    def largestDivisibleSubset(self, a: List[int]) -> List[int]:
        return max(reduce(lambda d,q:d|{q:max((d[p] for p in d if q%p<1),key=len)+[q]},sorted(a),{1:[]}).values(),key=len)
```

## Code #1.2 - Unwrapped
```python3
class Solution:
    def largestDivisibleSubset(self, a: List[int]) -> List[int]:
        d = {1:[]}
        for q in sorted(a):
            d[q] = max((d[p] for p in d if q%p==0), key=len) + [q]
        
        return max(d.values(), key=len)
```
[Ref](https://leetcode.com/problems/largest-divisible-subset/solutions/84002/4-lines-in-python)

(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be 'true' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Dynamic Programming', 'Sorting', 'Python', 'Python3']