Mini-Max Sum - HackerRank Solution (Java)

Watch out for overflow!
HackerRank Algorithm: Warmup - Mini-Max Sum (Java)
----------------------------------
Try it yourself here
www.hackerrank...
Previous video on overflow
• A Very Big Sum - Hacke...
HackerRank playlist
• HackerRank Solutions -...

[@daose]

First time submitting this I glazed over the constraints and definitely overflowed...

[@CyberZeo]

what was a good explanation, thank you 👍

[@abhis7478]

class Result { public static void miniMaxSum(List arr) { // Write your code here long sum=0; long max=Long.MIN_VALUE; long min=Long.MAX_VALUE; for(int i=0;i

[@mwildanarya]

why is yours O(2n) and not O(n^2)? sorry to ask because im new to this.

[@اناهنا-ب3و]

When I started this problem, I chose Java 7, but the class name was different than I used to work with and also than yours: It starts like this: public static void miniMaxSum(List arr) { I change the List arr to = int [] arr but give me an error : ====== ERROR ====== Solution.java:43: error: incompatible types: List cannot be converted to int[] Result.miniMaxSum(arr); ^ Note: Some messages have been simplified; recompile with -Xdiags:verbose to get full output 1 error ====== END ERROR ====== How can I fix this problem?

[@junaidahmed8594]

Amazing content, Keep up the awesome work

[@aimang1891]

public static void miniMaxSum(List arr) { long min = arr.get(0); long max = arr.get(0); long totalSum = 0; for(int n : arr){ totalSum += n; if(n < min) min = n; if(n > max) max = n; } System.out.println((totalSum-max) + " " + (totalSum-min)); }

[@BrunoHenrique-vd1ry]

Great content!!!

[@tejaschavan007]

superrr🤖🤖

[@aryanjain4571]

Great

[@deepanshukhorwal8938]

thanks

[@satarh709]

I think this is a not optimal solution, I just sorted the array and based of that you know where the min 4 are and max 4 by definition.

[@mrcricketanalyst]

sort will take nlogn tc this is linear

[@ritchievales]

@@mrcricketanalyst this! I came to look a solution here to see if I can improve my code getting rid of the sort method, this did the trick. thanks!

[@eoghanfeighery7383]

How do you do it with List arr in the public static header?

[@jagdishsurin8628]

Same problem facing

[@josefernandoperea2848]

A bit late, but sure it will help other person. Instead of using arr[0] you should use arr.get(0);

[@Conormcnproductions]

this is how I did it and it passes every test case: static long min, max; public static void miniMaxSum(List arr) { // Write your code here Collections.sort(arr); for(int i = 0; i

[@pandeyamit8777]

voice of video is too low

[@ilichnoise]

Only works for few cases in currently test need to change to long var. public static void miniMaxSum(List arr) { // Write your code here int max=arr.get(0); int min=arr.get(0); int total=0; for(int num:arr){ total+=num; if(num>max) max=num; if(num

[@LYJManchesterUnited]

class Result { public static void miniMaxSum(List arr) { Collections.sort(arr); // Sort the array in ascending order long minSum = 0; long maxSum = 0; // Calculate the minimum sum minSum = arr.get(0)+arr.get(1)+arr.get(2)+arr.get(3); maxSum = arr.get(1)+arr.get(2)+arr.get(3)+arr.get(4); System.out.println(minSum + " " + maxSum); } } why tf this doesn't work???!