Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1753. Maximum Score From Removing Stones
Given three piles, maximize the number of turns removing one stone from two different non-empty piles; the core challenge is optimally pairing stones until either the largest pile overwhelms the others or stones are exhausted. The result equals min(floor((a+b+c)/2), a+b+c - max(a,b,c)).
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.