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)).