Given an array of integers, find the minimum number of elements to remove such that in the remaining non-empty subarray or subset, the minimum element is at least twice the maximum element. Note that…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.