Question Details
LeetCode #124: Binary Tree Maximum Path Sum. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Asked at Salesforce in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Binary Tree
Depth-First Search
Tree
Binary Tree
Dynamic Programming
Graph
More from Salesforce
Reddit
Finally an Offer! After 9 months of hell
Reddit
Salesforce Low Level Design Interview Questions
1p3a
Salesforce MTS Interview Experience for Experienced Candidate
1p3a
Slack MTS/SMTS Backend Engineer Interview Experience at Salesforce
1p3a
Salesforce SMTS GCP Team Interview Experience and Process Overview