CareerCup

int maxProfit(int arr[])
{
  int max_profit = arr[1] - arr[0];
  int min = arr[0];  
  for(int i = 1; i < arr.length; i++)
  {      
    if((arr[i] - min) >max_profit)                              
      max_profit = arr[i] - min;
    if(arr[i] < min)
         min = arr[i];                    
  }
  return max_profit;
}

public static void findMaxStockProfit(int[] arr) {
        int maxSum = Integer.MIN_VALUE;
        int maxSumStartIndx = 0;
        int maxSumEndIndx = 0;

        int lastMinValueIndx = 0;
        int curIndx = 0;

        while(curIndx < arr.length) {
            int diff = arr[curIndx] - arr[lastMinValueIndx];
            if(diff > maxSum) {
                maxSum = diff;
                maxSumStartIndx = lastMinValueIndx;
                maxSumEndIndx = curIndx;
            }

            if(arr[lastMinValueIndx] > arr[curIndx]) {
                lastMinValueIndx = curIndx;
            }
            curIndx++;
        }
        System.out.println("MaxSum = " + maxSum + ". StartIndx = " + maxSumStartIndx + ". EndIndx = " + maxSumEndIndx);
    }

Very interesting problem. Lets scan the array and find out if we sold the share next day what would be our profit(+) or loss(-). So the new array is
-65,-11,18,83,-60,-42.-3,85,-93,95,5,-96
Now scan the array from left to right and keep summing continuous +ives and store it in a variable max. If the next continuous +ive sum is > max then store that value in max. At the end of the scan we will have the max output. Complexity O(n)

how is answer 101?

int maxprofit(int stockvalue[ ], int n)
{
	int max = 0;
	for(int i=1; i<n; i++)
	{
			if ( ( a[i] - a[i-1] ) > max )
				max = a[i] - a[i-1];
	}
	return max;
}

{
private static void calcDiff2(int[] input) {
Arrays.sort(input);
int maxDiff = 0;
for (int i = 0; i < input.length; i++) {
for (int j = i + 1; j < input.length; j++) {
int diff = input[j] - input[i];
if (diff > maxDiff) {
maxDiff = diff;
}
}
}
System.out.println("Max Difference is (2) --> " + maxDiff);
}

private static void calcDiff1(int[] input) {
int maxDiff = 0;
for (int i = 0; i < input.length; i++) {
for (int j = 0; j < input.length; j++) {
int diff = input[i] - input[j];
if (diff > maxDiff) {
maxDiff = diff;
}
}
}
System.out.println("Max Difference is (1) --> " + maxDiff);
}
}