Mini-Max Sum Hacker Rank Solution – Queslers

Problem: Mini-Max Sum Hacker Rank 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. Read program statement to find the Mini-Max Sum Hackerrank Solution in C++.

For example, arr = [1,3,5,7,9]. Our minimum sum is 1 + 3 + 5 + 7 = 16 and our maximum sum is 3 + 5 + 7 + 9 = 24. We would print
16 24
Function Description

Complete the miniMaxSum function in the editor below. It should print two space-separated integers on one line: the minimum sum and the maximum sum of 4 of 5 elements.

miniMaxSum has the following parameter(s):

arr: an array of 5 integers

Input Format

A single line of five space-separated integers.

Constraints

1<=arr[i]<=10^9
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

Mini-Max Sum Explanation

Our initial numbers are 1, 2, 3, 4, and 5. We can calculate the following sums using four of the five integers:

  1. If we sum everything except 1, our sum is 2+3+4+5=14.
  2. If we sum everything except 2, our sum is 1+3+4+5=13.
  3. If we sum everything except 3, our sum is 1+2+4+5=12.
  4. If we sum everything except 4, our sum is 1+2+3+5=11.
  5. If we sum everything except 5, our sum is 1+2+3+4=10

Mini-Max Sum Hacker Rank Solution

In C :

void miniMaxSum(int arr_count, int* arr) {
    int min = arr[0] ,  max;
     int j;
    for(int i=0; i < arr_count-1;i++)
    {  
      for(int  j=0; j< arr_count-i-1; j++)
      {
          if(arr[j] > arr[j+1])
          {
              min = arr[j];
              arr[j] = arr[j+1];
              arr[j+1] = min;
          }
         
      }
       
    }
Mini-Max Sum Hacker Rank Solution Review:

In our experience, we suggest you solve this Mini-Max Sum Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

Mini-Max Sum problem is available on Hacker Rank for Free, if you are stuck anywhere between a compilation, just visit Queslers to get Mini-Max Sum Hacker Rank Solution

Conclusion:

I hope this Mini-Max Sum Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.

This Problem is intended for audiences of all experiences who are interested in learning Programming in a business context; there are no prerequisites.

Keep Learning!

More Hacker Rank Problem & Solutions >>

Staircase Hacker Rank Solution

A Very Big Sum Hacker Rank Solution

Diagonal Difference Hacker Rank Solution

Nested Lists Hacker Rank Solution

Lists Hacker Rank Solution

Leave a Reply

Your email address will not be published.