Min-Max Sum Hackerrank solution

 Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.

Example

The minimum sum is  and the maximum sum is . The function prints

16 24

Function Description

Complete the miniMaxSum function in the editor below.

miniMaxSum has the following parameter(s):

• arr: an array of  integers

Print

Print two space-separated integers on one line: the minimum sum and the maximum sum of  of  elements.

Input Format

A single line of five space-separated integers.

Constraints

Output Format

Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers. (The output can be greater than a 32 bit integer.)

Sample Input

1 2 3 4 5

Sample Output

10 14

Explanation

The numbers are , , , , and . Calculate the following sums using four of the five integers:

1. Sum everything except , the sum is .
2. Sum everything except , the sum is .
3. Sum everything except , the sum is .
4. Sum everything except , the sum is .
5. Sum everything except , the sum is .

Hints: Beware of integer overflow! Use 64-bit Integer.

Solution :

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.function.*;

import java.util.regex.*;

import java.util.stream.*;

import static java.util.stream.Collectors.joining;

import static java.util.stream.Collectors.toList;

class Result {

    /*

     * Complete the 'miniMaxSum' function below.

     *

     * The function accepts INTEGER_ARRAY arr as parameter.

     */

    public static void miniMaxSum(List<Integer> arr) {

    // Write your code here

   

   long minSum =0; // Smallest value an int can hold

long maxSum =0; // Largest value an int can hold

int n=arr.size();

Collections.sort(arr);

for(int i=0;i<n-1;i++)

{

    minSum+=arr.get(i);

}

for(int i=1;i<n;i++)

{

     maxSum+=arr.get(i);

}

System.out.println(minSum + " " + maxSum);

    }

}

public class Solution {

    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))

            .map(Integer::parseInt)

            .collect(toList());

        Result.miniMaxSum(arr);

        bufferedReader.close();

    }

}