Mini-Max Sum

Sort by

recency

|

994 Discussions

|

  • + 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)
        }
    
  • + 0 comments

    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))

    • + 0 comments

      thats a clean and simple code

  • + 0 comments

    Java

    Approach : 1) Add all the elements of list 2) for finding minimum sum , subtract maximum element of list from sum 3) for finding maximum sum, subtract minimum element of list from sum

    double sum=0;
    
    for (int i = 0; i < arr.size(); i++) {
       sum += arr.get(i); 
    }
    
    double min = sum - Collections.max(arr);
    double max = sum - Collections.min(arr);
    
    System.out.printf("%.0f ", min);
    System.out.printf("%.0f", max);
    }