[C++] HackerRank Day14 Solution

/*
https://www.hackerrank.com/challenges/30-scope/problem

O(n) is the optimal answer.

*/



    Difference(vector<int> arr) {
        elements = arr;
    }

    int computeDifference() {
        int max = elements[0];
        int min = elements[0];
     
        for(int i=0; i< elements.size(); i++) {
            if(min > elements[i]) min = elements[i];
            else if(max < elements[i]) max = elements[i];
        }
     
        maximumDifference = max - min;
   
        return 1;
    }