Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3065. Minimum Operations to Exceed Threshold Value I
Given an array nums and threshold k, repeatedly remove the current smallest element until every remaining value is >= k; return the minimum number of removals required (equivalently, the count of elements strictly less than k, with the guarantee at least one element >= k).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.