mini-max sum [HackerRank] | Python | Algorithm | Interview
This video is about min-max sum problem from HackerRank.
Problem statement:
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.
For example,arr=1,3,5,7,9 . Our minimum sum is1+3+5+7=16 and our maximum sum is 3+5+7+9=24
we will print o/p as 16 24
Problem: https://www.hackerrank.com/challenges...
For 1 : 1 Tutoring
WhatsApp contact : 7278222619
mail: [email protected]
You can support via UPI : sattujaiswal@okhdfcbank
Follow us on:
Whatsapp:
https://chat.whatsapp.com/LNwHGukUizj...
Telegram:
https://t.me/joinchat/QJvaJ97Xuut6i_Zm
For Python homework help visit our sponsor site
https://letstacle.com/python-homework...
Facebook:
/ 779620502848988
/ codingcart
Linkedin:
/ satyendra-jaiswal-903588a2
/ codingcart
Instagram:
/ codingcart
#HackerRank #Algorithm #Interview
Watch video mini-max sum [HackerRank] | Python | Algorithm | Interview online without registration, duration hours minute second in high quality. This video was added by user Coding Cart 18 March 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 5,845 once and liked it 72 people.