Finding the minimum sum and maximum sum of a list of integers in an array

Question

I am currently working on a HackerRank practice question and I only pass 5 test cases and I have no idea why. I've thought of all edge cases that I can think of myself but I fail most test cases.

Problem: Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.

Example - The minimum sum is 1 + 3 + 5 + 7 = 16 and the maximum sum is 3 + 5 + 7 + 9 = 24. The function prints

16 24

This is my solution so far:

public static void miniMaxSum(List<Integer> arr) {
    // Write your code here
        Collections.sort(arr);
        int max = 0;
        int min = 0;
        int sum = 0;
        int smallest = arr.get(0);
        int largest = arr.get(4);
        for (int i=0; i<arr.size(); i++) {
            sum += arr.get(i);
        }
        min = sum - largest;
        max = sum - smallest;
   
        
        System.out.print(min+ " " + max);

    }

I have no idea what test cases I'm failing since it doesn't tell me. I've tried arrays with duplicates, massive numbers, unsorted, and it all gives me expected answer. Please help!

Well, they're not long integers, at the very least.

Dave Newton
– Dave Newton

2021-09-21 00:10:34 +00:00
Commented Sep 21, 2021 at 0:10 — Dave Newton
– Dave Newton, Commented Sep 21, 2021 at 0:10
that...solved it. i feel so dumb but thank you so much

user16225412
– user16225412

2021-09-21 00:12:19 +00:00
Commented Sep 21, 2021 at 0:12 — user16225412
– user16225412, Commented Sep 21, 2021 at 0:12
Glad you worked it out :)

Dave Newton
– Dave Newton

2021-09-21 00:17:30 +00:00
Commented Sep 21, 2021 at 0:17 — Dave Newton
– Dave Newton, Commented Sep 21, 2021 at 0:17

vvvvv · Accepted Answer · 2022-03-24 21:29:20Z

0

Use long datatype because there is possibility of Integer overflowing or use 16 bit Integer.

public static void miniMaxSum(List<Integer> arr) {
// Write your code here
    Collections.sort(arr);
    long max = 0;
    long min = 0;
    long sum = 0;
    long smallest = arr.get(0);
    long largest = arr.get(4);
    for (int i=0; i<arr.size(); i++) {
        sum += arr.get(i);
    }
    min = sum - largest;
    max = sum - smallest;

    
    System.out.print(min+ " " + max);

}
}

edited Mar 24, 2022 at 21:29

vvvvv

32.9k19 gold badges70 silver badges103 bronze badges

answered Mar 24, 2022 at 21:24

Mahak Gupta

12 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Finding the minimum sum and maximum sum of a list of integers in an array

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related