1. Given a set of coin denominators, find the minimum number of coins to make a certain amount of change.
2. You are given an array of n numbers, each of which may be positive, negative, or zero. Give an efficient algorithm to identify the index positions i and j to the maximum sum of the ith through jth numbers.