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

1 vote227 views1 answer
Dynamic 2d arr in c
C
0 vote230 views6 answers
C program boilerplate
C
0 vote197 views1 answer
Asasz
C
0 vote199 views1 answer
C program for assignment operator
C
3 votes237 views1 answer
Fast inverse square root explained
C
1 vote229 views1 answer
Prime number c program
C
0 vote226 views1 answer
Gcc option to show rules of makefile
C
1 vote197 views1 answer
Stop Redis in Ubuntu WSL
C
2 votes166 views2 answers
Swap variables in c
C
0 vote209 views2 answers
C print
C