Medium

LeetCode 1410 note: scan left to right, trying all six entities at each position and skipping past a match; chained replace does not work

LeetCode 3613 note: add edges from light to heavy; the weight when exactly k components remain is the answer, and 0 when n <= k

LeetCode 3612 note: simulate the four operations with a list; put the “result is non-empty” check inside the * branch, or * gets appended as a letter

LeetCode 2410 note: sort both sides, then same-direction pointers match the weakest player with the smallest trainer that is good enough

LeetCode 1353 note: each day, attend the event that ends earliest, using a min-heap of end days

LeetCode 3608 note: add edges back from the largest time; the time of the first edge that drops the component count below k is the answer

LeetCode 3607 note: Union-Find groups, one min-heap per group, and lazy deletion for offline stations

LeetCode 3572 note: keep the largest y for each x, then take the three largest

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving