In this video, I solve the “Mini-Max Sum” challenge on HackerRank using Python 3.
The objective was to:
* find the minimum possible sum of 4 numbers,
* find the maximum possible sum of 4 numbers,
* and print both results efficiently.
My approach:
* sort the array,
* sum the first 4 elements for the minimum,
* sum the last 4 elements for the maximum.
This challenge was not extremely difficult algorithmically, but it was a good exercise for:
* array traversal,
* sorting,
* indexing,
* and problem decomposition.
I recorded the complete solving process live with OBS as part of my competitive programming progression.
Platform: HackerRank
Language: Python 3
Challenge: Mini-Max Sum
