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.
public static void miniMaxSum(List<Integer> arr) {
// Write your code here
long min =1000000000;
long max =1;
long tot =0;
for(int i=0; i<arr.size(); i++) {
long currValue = arr.get(i).longValue();
if (currValue <= min) {
min = currValue;
}
if (currValue >= max) {
max = currValue;
}
tot = tot + currValue;
}
System.out.print("" +(tot-max) + " " +(tot-min));
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mini-Max Sum
You are viewing a single comment's thread. Return to all comments →