class Solution: def sortMatrix(self, grid: List[List[int]]) -> List[List[int]]: def sort_diagonal(sy, sx, reverse=True): y = sy x = sx elems = [] while y

def uncommonFromSentences(self, s1: str, s2: str) -> List[str]: freq = collections.Counter(s1.split()) + collections.Counter(s2.split()) return [word for word, cnt in freq.items() if cnt == 1]

def maxSubArray(self, nums: List[int]) -> int: tot = 0 mx = float('-inf') for num in nums: if tot + num > num: tot += num else: tot = num mx = max(mx, tot) return mx

class Solution: def maxNumberOfBalloons(self, text: str) -> int: freq = collections.Counter(text) ans_freq = collections.Counter('balloon') mn = float('inf') for ch, cnt in ans_freq.items(): mn = min(mn, freq[ch] / cnt) return int(mn)

class Solution: def maxDepth(self, root: Optional[TreeNode]) -> int: def dfs(node): if not node: return 0 l = dfs(node.left) r = dfs(node.right) return max(l, r) + 1 return dfs(root)

class Solution: def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]: def dfs(q, a): while q: y, x, cur_height = q.popleft() for ny, nx in [(y, x + 1), (y, x - 1), (y + 1, x), (y - 1, x)]: if not (0