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 vote211 views1 answer
Class to const void *
C
0 vote207 views1 answer
Ecs Invalid 'cpu' setting for task
C
1 vote202 views1 answer
Is 33 prime number
C
8 votes204 views1 answer
Arduino millis
C
0 vote202 views7 answers
C code to MIPS assembly converter online
C
0 vote202 views2 answers
Youtube code
C
0 vote208 views1 answer
Esp local control
C
0 vote211 views1 answer
C copy 2 strings\
C
1 vote215 views2 answers
C comment
C
0 vote210 views1 answer
Dynamic Memoray alocation For 2D
C