Easy

LeetCode 941 note: climb from the left to the peak, then descend; you must reach the end exactly, with the peak not at either end

LeetCode 938 note: prune with the BST order, going only right below low and only left above high, adding nodes inside the range

LeetCode 929 note: split at @, normalize only the local part (drop everything after +, remove dots), rejoin with the domain and collect in a set

LeetCode 925 note: one pointer each over name and typed; every typed character either matches the next name character or repeats the previous typed character

LeetCode 922 note: pointers i over even slots and j over odd slots, each stepping by two; when slot i holds an odd number, move j to a misplaced even and swap

LeetCode 917 note: two pointers each skip non-letters and swap when both point at letters; convert the string to a list first

LeetCode 914 note: every card count must be divisible by one X >= 2, i.e. the GCD of all counts is at least 2

LeetCode 908 note: lower the maximum by k and raise the minimum by k; the answer is max(0, max - min - 2k)

LeetCode 905 note: a write pointer swaps even numbers to the front, just like move zeroes

LeetCode 897 note: in-order traversal appending nodes to a right-only chain with left children cleared; keep the dummy separate from the moving tail

LeetCode 896 note: monotonic means non-increasing or non-decreasing; check both directions, allowing equal neighbors

LeetCode 892 note: a stack of v cubes has 4v + 2 faces; subtract 2 × min for each overlap with the stacks above and to the left