← Amazon questions

Special Stack, Bottom View of Binary Tree, and Subset Sum

Filed under Amazon

Implement a data structure supporting push, pop, top, and retrieving the minimum element in O(1) time (Special Stack). Find the bottom view of a binary tree, and solve the subset sum partition…

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.