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. Mini-Max Sum
  2. Discussions

Mini-Max Sum

Sort by

recency

|

282 Discussions

|

  • chaudharimedhaj
     + 0 comments

    Java Solution Easy to understand public static void miniMaxSum(List arr) {

    Collections.sort(arr);

long minSum = 0;
long maxSum =0;


for(int i = 0; i < arr.size() -1; i++ ){
    minSum += arr.get(i);
}

for(int i = 1; i < arr.size() ; i++ ){
    maxSum += arr.get(i);
}

System.out.println(minSum + " " + maxSum);
}

  • vladislav_ocere1
     + 0 comments

    // java code

    public static void miniMaxSum(List<Integer> arr) {
        long max = 0;
        long min = 0;
        
        for(int i = 0; i < arr.size(); i++) {
            long count = 0;
            
            for (int j = 0; j < arr.size(); j++) {
                if (j != i) {
                    count += arr.get(j);
                }
            }
            
            if (count > max || max == 0) max = count;
            if (count < min || min == 0) min = count;
        }
        
        System.out.printf("%d %d", min, max);
    }

  • jordanmonier4
     + 1 comment

    // C# error

    public static void miniMaxSum(List<int> arr)
    {
            long sumTotal = arr.Sum();
            long maxE = arr.Max();
            long minE = arr.Min();
            long min = sumTotal - maxE;
            long max = sumTotal - minE;
            Console.WriteLine($"{min}  {max}");
    }

  • fernandoituarte1
     + 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)

  • caribe_007
     + 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)