We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Mini-Max Sum
  5. Discussions

Mini-Max Sum

Sort by

recency

|

6069 Discussions

|

  • davimoreira
     + 0 comments
        let minValue = Infinity;
    let maxValue = -Infinity;
    let total = 0;
    
    for (let i = 0; i < arr.length; i++) {
        if (minValue > arr[i]) minValue = arr[i]
        if (maxValue < arr[i]) maxValue = arr[i]
        
        total+= arr[i];
    }
    
    console.log(total - maxValue, total - minValue)

  • mohamedhumayoon1
     + 0 comments
    sum=arr[0]+arr[1]+arr[2]+arr[3]+arr[4]
    for i in range(0,len(arr)):
        newarr.append(str(sum-arr[i]))
    print(min(newarr),max(newarr))

  • anarod_val25
     + 0 comments
    #include <bits/stdc++.h>
#include <numeric>
using namespace std;

string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);

/*
 * Complete the 'miniMaxSum' function below.
 *
 * The function accepts INTEGER_ARRAY arr as parameter.
 */

void miniMaxSum(vector<int> arr) {
    sort(arr.begin(),arr.end());
    
    long long max_sum = accumulate(arr.begin()+1,arr.end(),0LL);
    long long min_sum = accumulate(arr.begin(),arr.begin()+arr.size()-1,0LL);
    
    cout<<min_sum<<" "<<max_sum<<endl;   
}

  • h24021518
     + 0 comments
    void miniMaxSum(vector<int> arr) {
    sort(arr.begin(),arr.end());
    long sum1 = 0; long sum2 = 0;
    for (int i=0;i<5;i++){
        if (i<4) sum1 += arr[i];
        if (i>0) sum2 += arr[i];
    }
    cout <<sum1 << " " << sum2;
}

  • diyadavidpnc
     + 0 comments

    Java 7 Solution

    long minValue= arr.get(0),maxValue = arr.get(0),sum=0; 

        for(long x:arr)
 {
    if(x<=minValue)
        minValue =x;

     if(x>=maxValue)
        maxValue = x;

     sum+=x;
 }

 System.out.print((sum-maxValue));
 System.out.println(" "+(sum-minValue));