Question Details
LeetCode #124: Binary Tree Maximum Path Sum. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Asked at Adobe 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 Adobe
Reddit
CoinDCX Interview — DSA + System Design | External Expert Round
GeeksforGeeks
Adobe Interview Experience | 4 Years Experienced
1p3a
Adobe Frontend Engineering Fulltime Onsite Interview Experience
1p3a
Adobe MTS-2 Software Engineer Interview Experience and Questions
1p3a
Adobe Software Engineer Interview Experience (4 YOE) - Detailed Rounds