# [Leet Code] Lucky numbers in a matric

`Input: matrix = [[3,7,8],[9,11,13],[15,16,17]]Output: [15]Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column`
`Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]]Output: [12]Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column.`
`Input: matrix = [[7,8],[1,2]]Output: [7]`
`class Solution(object):    def luckyNumbers (self, matrix):        """        :type matrix: List[List[int]]        :rtype: List[int]        """        answers = []        for i in range(len(matrix)):            row = matrix[i].index(min(matrix[i]))            if min(matrix[i]) == max([column[row] for column in matrix]):                answers.append(matrix[i][row])                                    return answers`

--

--

--

Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.

## Matthew Boyd

Learning, and posting my findings!