Mini-Max Sum

Sort by

recency

|

397 Discussions

|

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

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

  • + 0 comments
    def miniMaxSum(arr):
        # Write your code here
        arr.sort()
        
        min_sum=sum(arr[0:len(arr)-1])
        max_sum=sum(arr[1:len(arr)])
        
        print(min_sum,max_sum)
    
  • + 0 comments
            long total = 0 ;
            long min = arr.get(0);
            long max = arr.get(0);
            for(int i: arr)
            {
                total += i ;
                if(i < min)
                {
                    min = i ;
                } 
                
                if(i > max)
                {
                    max = i ;
                }
            }
            
            long minSum = total - max;
            long maxSum = total - min;
            System.out.print(minSum + " " + maxSum);
    
  • + 0 comments

    Go / Golang


    `func miniMaxSum(arr []int32) { slices.Sort(arr) max:=0 min:=0

    for i,j:=0,len(arr)-1;i<len(arr)-1;i,j=i+1,j-1{
        min+=int(arr[i])    
        max+=int(arr[j])    
    }
    
    fmt.Println(min,max)
    

    }