Available question text
Given an array of pile sizes and k operations each removing floor(pile/2) stones from a chosen pile (possibly the same pile multiple times), minimize the final total by repeatedly applying the operation to the current largest pile — a greedy max-heap (priority queue) approach yields an efficient O((n+k) log n) solution for the given constraints.
Related questions
Continue with questions that share topics or the same question type.
- Avoid Flood in The City
Coding · Array · Binary Search · Greedy
- Furthest Building You Can Reach
Coding · Array · Greedy · Heap (Priority Queue)
- Meeting Rooms II
Coding · Array · Greedy · Heap (Priority Queue)
- Minimum Cost to Hire K Workers
Coding · Array · Greedy · Heap (Priority Queue)
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 1962. Remove Stones to Minimize the Total
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Salesforce
Remove Stones to Minimize the Total
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