Medium

LeetCode note for Word Break, rebuilt from the original learning note

LeetCode 3914 note: adding x to a range raises only the difference at its left edge by x, so the answer is the sum of all drops

LeetCode 3913 note: extract only the vowels, sort by (-count, first occurrence), and put them back into the vowel positions

LeetCode note for Cheapest Flights Within K Stops, rebuilt from the original learning note

LeetCode note for Delete and Earn, rebuilt from the original learning note

LeetCode 3909 note: walk to the peak and sum each side; the peak belongs to both, so including it or not does not change the comparison

LeetCode note for Coin Change, rebuilt from the original learning note

LeetCode note for House Robber II, rebuilt from the original learning note

LeetCode note for Path With Minimum Effort, rebuilt from the original learning note

LeetCode 3905 note: multi-source BFS one layer at a time, collecting the maximum color per cell before writing the layer back

LeetCode 3904 note: the first index where the prefix maximum minus the suffix minimum is <= k; build the suffix minimum right to left first

LeetCode 1514 note: multiplying probabilities only shrinks them, so Dijkstra applies; prune with <=