Skip to content

Create Keren_solution #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
MungaiKeren wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Create Keren_solution #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions algorithms/warmup/mini_max_sum/Keren_solution
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the miniMaxSum function below.
def miniMaxSum(arr):
total = sum(arr) # sum up all the integers in the array
sums = [total - arr[i] for i in range(len(arr))] # get the sum of only 4 of the integers

print(min(sums), max(sums))



if __name__ == '__main__':
arr = list(map(int, input().rstrip().split()))

miniMaxSum(arr)