Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Mini-Max Sum** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Mini-Max Sum – Hacker Rank Solution

Mini-Max Sum – Hacker Rank Solution

**Problem:**

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**

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**

Mini-Max Sum – Hacker Rank Solution

public class MiniMaxSum { 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)); } }