java 8 solution

public static void miniMaxSum(List arr) { // Write your code here Collections.sort(arr); long min=0; long max=0; for(int i=0;i<(arr.size()-1);i++){ min+=arr.get(i); } for(int i=1;i

Js

    function miniMaxSum(arr) {
        let sor = arr.sort((a,g)=> a - g)
        let min = (sor.slice(0,-1))
        let max = (sor.slice(1,))
        let one = min.reduce((q, r)=>q + r)
        let tow = max.reduce((q, r)=>q + r)
        console.log (one, tow)

}

Here is my c++ solution, you can watch the explanation here : https://youtu.be/2GlHrf4HQPE

#include <bits/stdc++.h>
using namespace std;
int main()
{
    vector<int> arr(5);
    for(int i = 0; i < 5; i++) {
        cin >> arr[i];
    }
    auto min_max = minmax_element(arr.begin(), arr.end());
    long long su = 0;
    su = accumulate(arr.begin(), arr.end(), su);
    cout << su - *min_max.second  << " " << su - *min_max.first;
    return 0;
}

In python we can do it in a single line:

print(sum(arr)-max(arr),sum(arr)-min(arr))

Can anyone tell me why my code was wrong and why below code not able to pass all test case but few.

Collections.sort(arr); Integer min=arr.get(0); Integer max=arr.get(arr.size()-1); Integer minSum=0; Integer maxSum=0; for (Integer i:arr) { if(i!=max) minSum+=i; if(i!=min) maxSum+=i; 34

System.out.println(minSum+" "

+maxSum );