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

|

400 Discussions

|

  • maurojim123
     + 0 comments

    function miniMaxSum(arr: number[]): void { let sortArray: number[] = arr.sort((a,b)=> a-b); let minimum:number = sortArray.slice(0,-1).reduce((a,b)=>a+b); let maximum:number = sortArray.slice(1).reduce((a,b)=>a+b);

    console.log(minimum, maximum);

    }

  • nandun5
     + 0 comments
     public static void miniMaxSum(List<int> arr_list)
    {
        int[] arr = arr_list.Order().ToArray();
        long min = 0, max = 0;
        
        for(int i = 0; i < 4; i++){
            min += arr[i];
            max += arr[arr.Length - i - 1];
        }
        
        Console.WriteLine($"{min} {max}");
    }

  • harishragavend14
     + 0 comments

    import java.util.*;

    public class Main { public static void main(String[] args) { List arr = new ArrayList<>(Arrays.asList(256741038,623958417,467905213,714532089,938071625));

      long totalSum = arr.stream().mapToLong(Integer::longValue).sum();
  System.out.println(totalSum);
  long max = 0;
  long min = totalSum;
  for (int value : arr){
    long temp = totalSum - value;
    if (temp > max) max = temp;
    if (temp < min) min = temp;
  }

  System.out.print(min+" "+max);

    } }

  • vawate01
     + 0 comments

    public static void miniMaxSum(List arr) { // Write your code here int sum = 0; int max = 0; int min = 0; for(int i=0;i

  • vawate01
     + 0 comments

    public static void miniMaxSum(List arr) { // Write your code here int sum = 0; int max = 0; int min = 0; for(int i=0;i