← Amazon questions

Pruning tree paths and custom O(log n) hash map with AVL tree

Filed under Amazon

Part 1: Given a binary tree and a target sum, remove all nodes that are not part of any path from root to leaf that sums to the target. Part 2: Design a hash map using an AVL tree for O(log n)…

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.