Easy

LeetCode 3074 note: apples can be split freely, so take boxes from the largest capacity until the total fits every apple

LeetCode 3069 note: simulate the rule: the first two go to separate arrays, then each element joins the array whose last element is larger

LeetCode 2859 note: count the set bits of the index, not of the value

LeetCode 1991 note: compute the total, maintain the left sum while scanning, and get the right sum as total - left - nums[i]

LeetCode 1732 note: the altitudes are prefix sums of gain starting from 0; take the maximum

LeetCode 1480 note: the definition of a prefix sum, adding each element to the previous running total

LeetCode 1413 note: the start value plus every prefix sum must be at least 1, so it is max(1, 1 - minimum prefix sum)

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 1791 note: the center lies on every edge, so the common endpoint of the first two edges is the answer

LeetCode 2357 note: each operation zeroes the group of the smallest positive value, so the answer is the number of distinct positive values