Mini-Max Sum

Sort by

recency

|

279 Discussions

|

  • + 0 comments
    const { sum, min, max } = arr.reduce((acc, curr) => {
            acc.sum += curr;
            acc.min = curr < acc.min ? curr : acc.min;
            acc.max = curr > acc.max ? curr : acc.max;
            return acc;
        },
        {
            sum: 0,
            min: Infinity,
            max: -Infinity,
        })
        console.log(sum - max, sum - min)
    
  • + 0 comments
    • from functools import reduce
    • min_sum = reduce(lambda x,y: x+y, sorted(arr, reverse=True)[1:])
    • max_sum = reduce(lambda x,y: x+y, sorted(arr)[1:])
    • print(min_sum, max_sum)
  • + 0 comments
    function miniMaxSum(arr) {
        let sum=0,min=arr[0],max=arr[0];
        for(let i=0; i<arr.length; i++){
            sum = sum + arr[i];
            if(arr[i]<min){
                min=arr[i];
            }
            if(arr[i]>max){
                max=arr[i];
            }
        }
        console.log(sum-max,sum-min)
    }
    
  • + 0 comments

    //node code

    function miniMaxSum(arr) {
        // Write your code here
        let result = [0, 0];
        let sort = arr.sort((x,y) => x-y)
        
        sort.forEach((val, i) => {
            if(i == 0){
                result[1] += sort.filter((_, index) => index !== i)
                    .reduce((idx, val) => idx + val, 0);
            }else if(i == sort.length - 1){
                result[0] += sort.filter((_, index) => index !== i)
                    .reduce((idx, val) => idx + val, 0);
            }
        })
        console.log(result[0], result[1])
    }
    
  • + 0 comments

    // java code

    int min = Integer.MAX_VALUE; int max = Integer.MIN_VALUE; long sum = 0;

       for (int x : arr){
           sum += x;
          if (x < min)
             min = x;
        }
         for (int x : arr){
            if (x > max)
                max = x;
        }
    
        long minSum = sum - max;
        long maxSum = sum - min;
    
        System.out.print(minSum +" " + maxSum);
    
    }
    

    }