Mini-max sum hackerrank

Hackerrank min max sum solution

function miniMaxSum(arr) {
  let sum = 0
  let max = 0
  let min = arr[0]
  
  for(let i = 0; i < arr.length; i++) {
    
       sum += arr[i]
    
       if(arr[i] < min) {
         min = arr[i]
       }

       if(arr[i] > max) {
        max = arr[i]
      }
  }

 console.log((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);

-1

Source: hackerrank.com

Similar codes

0 vote400 views1 answer
Pasar a binario recursivo
C
0 vote383 views1 answer
C programming print pattern pyramid
C
48 votes531 views2 answers
Math.floor(Math.random() *10)
C
0 vote392 views2 answers
How to determine the level of each node in the given tree?
C
0 vote420 views1 answer
Uri/Beecrowd problem no - 1149 solution in C
C
0 vote389 views1 answer
Mediawiki upload size
C
10 votes432 views2 answers
Int num = (rand() % (upper - lower + 1)) + lower;
C
0 vote405 views1 answer
What does packing mean in c
C
0 vote368 views1 answer
+ *********************
C
0 vote377 views2 answers
Struct main function c in unix
C