Prasad stock solution

gistfile1.txt

// given an array of prices, determine the largest profit that can be made

[310, 315, 275, 295, 260, 270, 290, 230, 255, 250]

private int findMaxProfit(int[] stockPrices) {

    int maxProfit = 0;
    // TODO: Implement later
    validateStockPrices();
    
    for (for int i = 0; i < stockPrices.length - 2; i++) {
      for (int j = i + 1; j < stockPrices.length - 1; j++) {
          int profit = stockPrices[j] - stockPrices[i];
          if (profit > maxProfit) {
              maxProfit = profit;
          }
      }
    }
    
    return maxProfit;

}