# Solution.java

an anonymous user · January 26, 2023
Java
```class Solution {

// Complete the miniMaxSum function below.

/**
* Approach - compute sum of array
* Based on example arr [1,3,5,7,9] -> minSum is 1+3+5+7 = sum - largest element in array
* maxSum is 3+5+7+9 = sum - smallest element
* therefore, compute largest & smallest elements in array
* @param arr
*/
static void miniMaxSum(int[] arr) {
// System.out.println(Arrays.toString(arr));
long min = (long) Integer.MAX_VALUE, max = (long)Integer.MIN_VALUE;
long currSum = 0;
for (int j : arr) {
currSum += j;
if (j < min) {
min = j;
}
if (j > max) {
max = j;
}
}
System.out.println((currSum-max) + " " + (currSum - min));

}

private static final Scanner scanner = new Scanner(System.in);

public static void main(String[] args) {
int[] arr = new int[5];

String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (int i = 0; i < 5; i++) {
int arrItem = Integer.parseInt(arrItems[i]);
arr[i] = arrItem;
}

miniMaxSum(arr);

scanner.close();
}
}```
Output
`(Run the program to view its output)`