← Amazon questions

Sliding window minimum using Binary Search Tree

Filed under Amazon

Given an array of integers and a window size k, find the minimum element in every sliding window of size k using a Binary Search Tree (BST) to maintain the window elements.

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.