You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

Given a set of distinct positive integers, find the largest subset where every pair of elements (i, j) in the subset satisfies either i % j == 0 or j % i == 0. Return this largest divisible subset.