This repo was created as a collection of interesting problem solutions.
count '1' in binary representation of any non-negative integer via recursion and log2.
take list(list1, list2, ..., listn) and return all possible unique combinations of their elements.