Mini-Max Sum

Sort by

recency

|

995 Discussions

|

  • + 0 comments
    public static void miniMaxSum(List<Integer> arr) {
            // Write your code here
            long total = 0;
            for (int num : arr) {
                total += num; // accumulate as long
            }
            long min_sum = total - Collections.max(arr);
            long max_sum = total - Collections.min(arr);
            
            System.out.println(min_sum + " " + max_sum);
        }
    
  • + 0 comments

    function miniMaxSum(arr: number[]): void { // Write your code here const sortedArray = arr.sort(); const minSum = sortedArray.slice(0,sortedArray.length-1).reduce((acc,val) => acc + val, 0); const maxSum = sortedArray.slice(1).reduce((acc,val) => acc + val, 0); console.log(minSum, maxSum) }

  • + 0 comments

    Another approach but not all test cases are passing.

    def miniMaxSum(arr: Array[Int]) {
        // Write your code here
        var min: Long = 0
        var max: Long = 0
        var sortedNum = arr.sorted
        print(sortedNum.take(4).sum)
        print(" ")
        print(sortedNum.takeRight(4).sum)
        }
    
  • + 1 comment

    In scala maximum test cases are not passing.

     def miniMaxSum(arr: Array[Int]) {
        // Write your code here
        var total: Long = arr.sum
        var minEle = arr.min
        var maxEle = arr.max
        
        var minSum: Long = total - maxEle
        var maxSum: Long = total - minEle
        
        print(minSum+" "+maxSum)
        }
    }
    
  • + 1 comment

    def miniMaxSum(arr): print((sum(arr) - max(arr)), sum(arr) - min(arr))