Medium

LeetCode 2762 note: a sliding window with two monotonic queues for the window maximum and minimum

LeetCode 1358 note: an “at least one each of a, b, c” counting window: keep shrinking while all three are present, then count += left

LeetCode 3815 note: one max-heap per item, push a new entry on every bid change, and drop stale entries on query

LeetCode 3814 note: sort by cost with a prefix maximum of capacity, and bisect the most expensive partner for each machine

LeetCode 2904 note: with exactly k ones in the window, also shrink away leading zeros to get the shortest beautiful substring ending at right; compare by length first, then lexicographically

LeetCode 2875 note: strip target // sum full cycles; the remainder is smaller than one cycle, so a sliding window over two copies of nums always finds it

LeetCode 1234 note: after replacing a window, every character outside it must be at most n / 4; a shortest-window slide tracks the counts outside the window

LeetCode 1040 note: max moves = total gaps minus the edge gap the first move wastes; min moves uses a length-n window holding the most stones, with a special case of 2 when n - 1 stones are already consecutive and one is far away

LeetCode 395 note: “every character at least k times” is not monotonic, so a direct slide fails; divide and conquer splits on characters with fewer than k occurrences, or fixing the number of distinct characters makes the window slidable

LeetCode 3810 note: one operation fixes every position holding a value, so the answer is the number of distinct values at mismatched positions

LeetCode 3809 note: keep towers within the Manhattan radius and take the minimum by (-quality, x, y), which also handles ties

LeetCode 3413 note: the best k bags always have one end on a segment boundary; compute “left end at a segment start” and “right end at a segment end” (the latter by mirroring and reusing the same function)