Given a list of integers and a target number, the problem is to find the closest subsequence of that list that add up to the target number, return the sum of that subsequence
Given a target string and a set of characters, the problem is to find the minimal number of times the set of characters need to be used to form the target string, and return the order in which the characters are used
Given an array of integers and a range of elements that could be in the array, the problem is to find the number of ways to construct the array such that the array has exactly K distinct integers in it
Given an undirected tree, the problem is to find the sum of the distances between each pair of nodes in the tree, and return an array that contains the sum of distances between the node i and all other nodes, in the same order as the input