← Amazon questions

Tree Sum Replacement, Sliding Window Min/Max, and 3-Sum

Filed under Amazon

Solve four distinct algorithmic problems: (1) Replace every node in a binary tree with the sum of its larger nodes; (2) Find minimum and maximum for all sliding windows of size k; (3) Find the first k…

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.