mini-max sum [HackerRank] | Python | Algorithm | Interview

Published: 18 March 2020
on channel: Coding Cart

5,845

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, duration hours minute second in high quality that is uploaded to the channel Coding Cart 18 March 2020. Share the link to the video on social media so that your subscribers and friends will also watch this video. This video clip has been viewed 5,845 times and liked it 72 visitors.

4,188

149