Heap-Priority-Queue

LeetCode 2335 note: the answer is max(the largest count, ceil(total / 2)); simulating means filling one cup from each of the two largest every second

LeetCode 2231 note: odd digits swap only with odd digits and even with even; sort each group and refill each position with the largest digit of its parity

LeetCode 2099 note: pick the k largest values along with their indices, then sort by index to restore the original order

LeetCode 1464 note: all values are positive, so take the two largest a and b and return (a - 1)(b - 1)

LeetCode 1337 note: soldiers come first in each row, so binary search the first 0 for the count; sort by (count, row index) and take k

LeetCode 264 note: three pointers mark the next ugly numbers to multiply by 2, 3 and 5; take the minimum each time and advance every pointer that produced it

LeetCode 215 note: keep a min-heap of size k whose top is the k-th largest, or use quickselect for O(n) on average

LeetCode 1046 note: from a max-heap (negated values) take the two heaviest each round, push back their difference if unequal, and return the last stone or 0

LeetCode 703 note: keep a min-heap of size k; its top is the k-th largest

LeetCode 506 note: sort indices by score descending, give medals to the top three and rank strings to the rest, writing back into the original positions