Algorithm in JavaScript: Finding the Minimum and Maximum Sums

In this blog post, we'll dive into solving the Mini-Max Sum algorithm challenge from HackerRank using JavaScript. We'll explore the problem statement, discuss the approach to solve it, and provide a step-by-step breakdown of the JavaScript solution.

Problem Statement:
The Mini-Max Sum algorithm challenge requires finding the minimum and maximum possible sums that can be obtained by summing exactly four out of the five integers in a given array.

Approach and Solution:
To solve the Mini-Max Sum algorithm challenge, we can follow these steps:

Sort the input array in ascending order. This allows us to easily identify the smallest and largest elements.
Calculate the minimum sum by adding the first four elements of the sorted array using the reduce function.
Calculate the maximum sum by adding the last four elements of the sorted array using the reduce function.
Output the minimum and maximum sums.
Here's the JavaScript implementation of the solution:

function miniMaxSum(arr) {
    const sortedArray = arr.sort((a,b) => a - b);
    const minSum = sortedArray.slice(0, arr.length - 1).reduce((acc, sum) => acc + sum);
    const maxSum = sortedArray.slice(1).reduce((acc, sum) => acc + sum);
    console.log(minSum, maxSum);
}

Example Usage:
Let's consider an example to demonstrate the solution. Suppose we have an input array [1, 2, 3, 4, 5]. Calling the miniMaxSum function with this array as an argument will provide us with the minimum and maximum sums.

const arr = [1, 2, 3, 4, 5];
miniMaxSum(arr); // Output: 10 14

In this example, the minimum sum is obtained by adding the first four elements [1, 2, 3, 4], resulting in 10. The maximum sum is obtained by adding the last four elements [2, 3, 4, 5], resulting in 14.`

Conclusion:
In this blog post, we explored the HackerRank Mini-Max Sum algorithm challenge and learned how to find the minimum and maximum sums of an array of integers using JavaScript. We discussed the problem statement, provided a step-by-step breakdown of the approach, and demonstrated an example usage. By understanding the algorithm and implementing the provided solution, you can successfully solve the Mini-Max Sum challenge on HackerRank.