Leetcode 3634. Minimum Removals to Balance Array

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3634. Minimum Removals to Balance Array

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact