Skip to content

July19 #1704

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ivanpenaloza merged 2 commits into from
Jul 19, 2026
Merged

July19 #1704

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
be51760
adding updates
ivanpenaloza Jul 19, 2026
3c68a26
adding updates
ivanpenaloza Jul 19, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion src/my_project/interviews/google_top_exercises/round_1/21_binary_tree_maximum_path_sum.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,6 +6,8 @@ def __init__(self, val=0, left=None, right=None):
self.left = left
self.right = right



class Solution:

def __init__(self):
Expand Down Expand Up @@ -37,4 +39,5 @@ def dfs(node: Optional[TreeNode]) -> int:
return node.val + max(left_max, right_max)

dfs(root)
return self.max_sum
return self.max_sum

Loading