← Amazon questions

Stock Max Profit, BST to Sum Tree, and Pair Sum

Filed under Amazon

Solve three classic sub-problems: (1) Find the maximum profit from multiple stock transactions or a single transaction with a minimum buy constraint; (2) Convert a Binary Search Tree (BST) into a Sum…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.