Skip to content

Latest commit

 

History

History
59 lines (34 loc) · 856 Bytes

Sum_of_Minimums.md

File metadata and controls

59 lines (34 loc) · 856 Bytes

CodeWars Python Solutions


Sum of Minimums!

Given an 2D list of size m * n. Your task is to find the sum of minimum value in each row.

Examples

[
  [1,2,3,4,5], # minimum value of row is 1
  [5,6,7,8,9], # minimum value of row is 5
  [20,21,34,56,100] # minimum value of row is 20
]

So, the function should return 26 because sum of minimums is as 1 + 5 + 20 = 26

Note: You will be always given non-empty list containing Positive values.


Given Code

def sum_of_minimums(numbers):
    pass

Solution 1

def sum_of_minimums(numbers):
    return sum([min(nums) for nums in numbers])

Solution 2

def sum_of_minimums(numbers):
    return sum(map(min, numbers))

See on CodeWars.com