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. Prepare
  2. Algorithms
  3. Warmup
  4. Mini-Max Sum
  5. Discussions

Mini-Max Sum

Sort by

recency

|

6053 Discussions

|

  • lukasz_jozefowi1
     + 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);

    }

  • mouha22talibi
     + 0 comments

    **Solutions In PHP : ** * Using Loop* function miniMaxSum(array Extra open brace or missing close bracearraySize = count($arr);

        // total sum
    `$totalSum = array_sum($`arr);

    // maxValue & minValue vars ( for the next logic)
    `$maxValue = max($`arr);
    `$minValue = min($`arr);

    // maxSum & minSum vars
    `$maxSum = $`minSum = 0;

    // looping array the calculate maxSim
    for (`$x = 0; $`x < `$arraySize; $`x++) {
        `$maxSum += $`arr[$x];
    }

    // looping array the calculate min
    for (`$x = 0; $`x < `$arraySize; $`x++) {
        `$minSum += $`arr[$x];
    }

    print `$minSum = $`minSum - $maxValue;
    print " ";
    print `$maxSum = $`maxSum - $minValue;
}

  • mouha22talibi
     + 0 comments

    **Solutions In PHP : **

        *Using Built In Functions :* 
        function miniMaxSum(array $arr) {
    // total sum
    `$totalSum = array_sum($`arr);

    // mawSum & minSum vars
    `$maxSum = $`totalSum - min($arr);
    `$minSum = $`totalSum - max($arr);

    // print values
    print $minSum;
    print " ";
    print $maxSum;
}

  • igor_brishkoski
     + 0 comments
    fun miniMaxSum(arr: Array<Int>) {
    var min = arr[0]
    var max = arr[0]
    var sum: Long = 0

    arr.forEach {
        if (it > max) {
            max = it
        }

        if (it < min) {
            min = it
        }

        sum += it
    }
    println("${sum - max} ${sum - min}")
}

  • vudungoik2016
     + 0 comments
    function miniMaxSum(arr: number[]): void {
    let minValue = 0;
    let maxValue = 0;
    const sortedArray = arr.sort()
    if(sortedArray[0] === sortedArray[1]){
        maxValue = minValue = sortedArray.splice(0, sortedArray.length - 1).reduce((a,b) => a+b, 0)
        console.log(`${minValue} ${maxValue}`)
        return
    }
    const maxFlag = sortedArray[arr.length - 1]
    const minFlag = sortedArray[0]
    minValue = sortedArray.filter((a)=> a !== maxFlag).reduce((a,b)=> a+b, 0)
    maxValue = sortedArray.filter((a)=> a !== minFlag).reduce((a,b)=> a+b, 0)
    console.log(`${minValue} ${maxValue}`)
}