You are viewing a single comment's thread. Return to all comments →
O(n) solution get 4 numbers a circular ring like fashon and see if they are min or max sum.
def miniMaxSum(arr): sum_largest = 0 sum_smallest = float("inf") for i in range(0,len(arr)): curr_sum = arr[i%5]+arr[(i+1)%5]+arr[(i+2)%5]+arr[(i+3)%5] sum_smallest = min(sum_smallest,curr_sum) sum_largest = max(sum_largest,curr_sum) print(sum_smallest,sum_largest)
def miniMaxSum(arr):
sum_largest = 0 sum_smallest = float("inf") for i in range(0,len(arr)): curr_sum = arr[i%5]+arr[(i+1)%5]+arr[(i+2)%5]+arr[(i+3)%5] sum_smallest = min(sum_smallest,curr_sum) sum_largest = max(sum_largest,curr_sum) print(sum_smallest,sum_largest)
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 →
O(n) solution get 4 numbers a circular ring like fashon and see if they are min or max sum.