LeetCode
Question
#1373 Maximum Sum BST in Binary Tree
Question Details
LeetCode #1373: Maximum Sum BST in Binary Tree. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree. Asked at Amazon 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 Search Tree
Binary Tree
Depth-First Search
Tree
Binary Search
Binary Tree
Dynamic Programming
Graph
More from Amazon
Reddit
175 k remote offer or 300 k in Bay Area
Reddit
Done with 3 rounds of On-site Amazon SDE 1 interview , but no communication after that. What to do?
Reddit
Nned direction for future prepration.
Reddit
Have an Amazon. SDE1 interview in 4 days, need tips
Reddit
After many years in the industry, I still struggle with textbook definitions in interviews