Medium

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode 164 note: the maximum gap is at least the average gap, so with buckets no wider than that it lies between consecutive non-empty buckets; keep each bucket’s min and max for O(n)

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode 3508 note: a queue for FIFO, a set for duplicates, and an increasing time list per destination queried with bisect

LeetCode 3494 note: for each potion, push forward to get the last wizard’s finish time (everyone must be free), then subtract backward to get each wizard’s finish time

LeetCode 3493 note: convert each row to a set, compare intersection sizes pairwise to add edges, then count components

LeetCode 2487 note: the kept nodes are non-increasing left to right; keep a monotonic stack, pop anything smaller than the new node, then link what remains