Available question text
Given a binary tree with integer node values, calculate path sums where odd-valued nodes trigger alternate node summation and even-valued nodes sum all nodes to leaf. Return the maximum sum among all possible paths.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Find the Maximum Sum of Node Values
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
- Choose K Elements With Maximum Sum
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Oracle
Maximum Path Sum with Conditional Node Processing
Reported Oct 16, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source