Available question text
Given nums and k, remove the fewest elements so the remaining array has max ≤ k * min. Equivalently, find the largest subset of numbers with max/min ≤ k and return n minus that subset size.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
- Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
- Minimum Size Subarray Sum
Coding · Array · Binary Search · Prefix Sum
- Minimum Sum of Squared Difference
Coding · Array · Binary Search · Greedy
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3634. Minimum Removals to Balance Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Salesforce
Minimum Removals to Balance Array
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 55.3. This is not an interview probability.
View source