CareerCup

There is an island surrounded by oil mines. You will be given n companies and m oil mines having values. You have to distribute the mines to "n" companies in fair manner. Remember the companies can have oil mines adjacent to each other and not in between of each others.After distributing them compute the differnce of oil mines from the company getting highest and company getting lowest. This number should be minimum.(then only the distribution can be termed as fair).


Example
Input
2
2 4
6 13 10 2
2 4
6 10 13 2

output
5
1

We have 52 week price list for a stock S. Suppose that during this period, we want to buy 100 stocks of S and sell all of them at a later day (within the 52 week window). We want to know when should we have bought and sold in order to make maximum profit. (If there is no profit making scenario, then it should be reported).
Example, for a small 4 week window: P1 = 14, P2 = 6, P3 = 7, P4 = 11 Then the output should be "Buy on 2 and sell on 4". Short selling is not allowed.
How can you best classify the type of the algorithm? (Greedy or Divide & Conquer or Dynamic Programming, etc..)

Given a list of stocks with their respective market capitalizations. The stock’s market cap are updated every minute based on its trading in the market. I have a strategy that wants a list of top 10 highest capped stocks in the market. This query can happen multiple times during the day.
Question: What would be the most appropriate data structure that can be used to efficiently implement the list of stocks? Discuss pros/cons of various data structures. Please briefly explain your answer.