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 vote262 views1 answer
Shuffle function in c
C
0 vote272 views1 answer
Meaning of &variable c
C
0 vote287 views1 answer
Arrange numbers in ascending order in c
C
0 vote285 views1 answer
Calling of a void in c
C
-1 vote276 views1 answer
Smallest c program ever
C
0 vote314 views1 answer
Ecto where is not nil
C
0 vote257 views1 answer
Jock cranley
C
0 vote264 views2 answers
233 pounds to inr
C
0 vote273 views2 answers
#pragma pack(1) in c
C
10 votes288 views4 answers
Arrays in C
C