Leetcode 368. Largest Divisible Subset

Given distinct positive integers, return the largest subset in which for every pair of elements one divides the other. This reduces to finding the longest chain under the divisibility relation (n ≤ 1000), commonly solved by sorting and dynamic programming to reconstruct the subset.