This was the first question:\n\n```\nGiven a non-empty array of integers, return up to k most frequent elements, in the order of frequency descending.\n\nExample: [1,1,1,2,2,3] and k = 2\n\n```\nand here was the second:\n\n```\nWrite a function that, given a binary tree of integers, returns the sums of all the root-to-leaf paths.\n\nExample:\n          2\n         / \\\n        3   5\n      /  \\\n     1    5\n\n```

This was the first question:\n\n\nGiven a non-empty array of integers, return up to k most frequent elements, in the order of frequency descending.\n\nExample: 