Sort by

recency

|

6057 Discussions

|

  • + 0 comments
    public static void miniMaxSum(List<Integer> arr) {
        // Write your code here
    
            long totalSum = 0;
            int minNumber = Integer.MAX_VALUE;
            int maxValue = Integer.MIN_VALUE;
        
            for (Integer integer : arr) {
                
                minNumber = Math.min(minNumber , integer);
                maxValue = Math.max(maxValue, integer);
                totalSum += integer;
            }
            
            System.out.print(totalSum - maxValue + " ");
            System.out.println(totalSum - minNumber);
            
        }
    
  • + 0 comments

    !/bin/python3

    import math import os import random import re import sys

    #

    Complete the 'miniMaxSum' function below.

    #

    The function accepts INTEGER_ARRAY arr as parameter.

    #

    def miniMaxSum(arr): # Write your code here maxs = sum(arr)-max(arr) mins = sum(arr)-min(arr) return maxs, mins if name == 'main':

    arr = list(map(int, input().rstrip().split()))
    a,b = miniMaxSum(arr)
    print(a,b)
    
  • + 0 comments

    solution in python using inbuilt functions..

    def miniMaxSum(arr):

    maxs=sum(arr)-min(arr)
    mins=sum(arr)-max(arr)
    print(mins,maxs)
    
  • + 2 comments

    I want to recieve feedback to improve about my solution y Javascript:

    function miniMaxSum(arr) {
        let aux=0, valMax=0,valMin=0;
    		//solution to define valMin because inicialize it with 0 it's problematic
        arr.forEach((num)=>{
            valMin+=num;
        })
        for(let i=0;i<arr.length;i++){
            for(let j=0;j<arr.length;j++){
                if(i!=j){
                    aux+=arr[j]
                }
            }
            if(aux<=valMin){
                valMin=aux;
            }
            if(aux>=valMax){
                valMax=aux;
            }
            aux=0;
            
        }
        console.log(`${valMin} ${valMax}`)
    
    }
    
  • + 0 comments

    Java with streams:

    public static void miniMaxSum(List<Integer> arr) {
            arr.sort(Comparator.naturalOrder());
            long min = arr.stream()
                .mapToLong(ele -> (long) ele)
                .limit(arr.size() - 1)
                .reduce(0L, Long::sum);
            long max = arr.stream()
                .mapToLong(ele -> (long) ele)
                .skip(1L)
                .reduce(0L, Long::sum);
            System.out.println(min + " " + max);
    
        }