We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def min_max_sum(arr):
# Write your code here1 2 3 4
result = []
for i in range(len(arr)):
org = arr[:]
org.pop(i)
result.append(sum(org))
return f"{min(result)} {max(result)}"
if name == 'main':
arr = list(map(int, input().rstrip().split()))
b = min_max_sum(arr)
print(b)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mini-Max Sum
You are viewing a single comment's thread. Return to all comments →
This might be simple in python
def min_max_sum(arr): # Write your code here1 2 3 4 result = [] for i in range(len(arr)): org = arr[:] org.pop(i) result.append(sum(org)) return f"{min(result)} {max(result)}"
if name == 'main':