← Amazon questions

Min removals so max element is at most twice the min

Filed under Amazon

Given an integer array `nums`, find the minimum number of elements to remove such that the maximum element of the remaining array is at most twice its minimum element (max <= 2 * min).

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.