Mini-Max Sum

Sort by

recency

|

272 Discussions

|

  • + 0 comments

    Simple JavaScript/NodeJs solution:

    function miniMaxSum(arr) { // Write your code here let min = arr[0]; let max = arr[0]; let totalArrSum = 0;

    for (let i = 0; i < arr.length; i++) {
        totalArrSum += arr[i];
        if (arr[i] < min) {
            min = arr[i];
        }
        if (arr[i] > max) {
            max = arr[i];
        }
    }
    
    console.log(``${totalArrSum - max} $`{totalArrSum - min}`);
    

    }

  • + 0 comments
    #include <bits/stdc++.h>
    using namespace std;
    
    void miniMaxSum(vector<int> arr) {
        sort(arr.begin(), arr.end());
        long long minSum = accumulate(arr.begin(), arr.begin() + 4, 0LL);
        long long maxSum = accumulate(arr.end() - 4, arr.end(), 0LL);
        cout << minSum << " " << maxSum << endl;
    }
    
    int main() {
        vector<int> arr(5);
        for (int i = 0; i < 5; i++) cin >> arr[i];
        miniMaxSum(arr);
        return 0;
    }
    
  • + 0 comments
    function miniMaxSum($arr) {
        $pepe = [];
        for ($e = 0; $e < count($arr); $e++){
            $pepe[$e] = array_sum($arr) - $arr[$e];
        }
        echo min($pepe)." ".max($pepe);
    }
    
  • + 0 comments

    ![](wwwwwwhttps://heuk akun fire fire)

  • + 0 comments
    def miniMaxSum(arr):
        sortedarr = sorted(arr)
        print(sum(sortedarr[:4]), sum(sortedarr[1:]))