From be517602dc60e3b341ba460effae5306b1969f81 Mon Sep 17 00:00:00 2001 From: ivan Date: Sun, 19 Jul 2026 05:12:53 -0600 Subject: [PATCH 1/2] adding updates --- .../round_1/21_binary_tree_maximum_path_sum.py | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py b/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py index 9afb981c..ad44f67e 100644 --- a/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py +++ b/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py @@ -6,6 +6,7 @@ def __init__(self, val=0, left=None, right=None): self.left = left self.right = right + class Solution: def __init__(self): @@ -37,4 +38,5 @@ def dfs(node: Optional[TreeNode]) -> int: return node.val + max(left_max, right_max) dfs(root) - return self.max_sum \ No newline at end of file + return self.max_sum + From 3c68a262e02a0c0c808a6b07e612589fd6ee0a96 Mon Sep 17 00:00:00 2001 From: ivan Date: Sun, 19 Jul 2026 05:13:40 -0600 Subject: [PATCH 2/2] adding updates --- .../round_1/21_binary_tree_maximum_path_sum.py | 1 + 1 file changed, 1 insertion(+) diff --git a/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py b/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py index ad44f67e..b343982d 100644 --- a/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py +++ b/src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py @@ -7,6 +7,7 @@ def __init__(self, val=0, left=None, right=None): self.right = right + class Solution: def __init__(self):