Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1198 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1198 # by problem number
lcpy gen -s find_smallest_common_element_in_all_rows # by problem name
m x n matrix mat where every row is sorted in strictly increasing order, return the smallest common element in all rows.
If there is no common element, return -1.
Input: mat = [[1,2,3,4,5],[2,4,5,8,10],[3,5,7,9,11],[1,3,5,7,9]]
Output: 5
Input: mat = [[1,2,3],[2,3,4],[2,3,5]]
Output: 2
class Solution:
# Time: O(m * n)
# Space: O(m * n)
def smallest_common_element(self, mat: list[list[int]]) -> int:
counts: dict[int, int] = {}
for row in mat:
for x in row:
count = counts.get(x, 0) + 1
if count == len(mat):
return x
counts[x] = count
return -1
| Time | Space |
|---|---|
| O(m * n) | O(m * n) |