mini-max sum hackerrank solution
static void miniMaxSum(int[] arr) {
long min = 0, max = 0, sum = 0;
min = arr[0];
max = min;
sum = min;
for (int i = 1; i < arr.length; i++) {
sum += arr[i];
if (arr[i] < min) {
min = arr[i];
}
if (arr[i] > max) {
max = arr[i];
}
}
System.out.print((sum - max) + " " + (sum - min));
}mini-max sum hackerrank solution
string[] arr_temp = Console.ReadLine().Split(' ');
long[] arr = Array.ConvertAll(arr_temp, Int64.Parse);
long result1 = 0;
long result2 = 0;
long max = arr.Max();
long min = arr.Min();
for (int i = 0; i < arr.Length; i++)
{
result1 += arr[i];
result2 += arr[i];
}
Console.WriteLine("{0} {1}",result1 - max,result2 - min);Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
