LeetCode

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

LeetCode 759 note: k-way merge all work intervals by start; any gap after the latest end so far is common free time

LeetCode 3919 note: walk one step at a time, each costing 1 (when the next index is the closest) or the gap; jumping is never cheaper, so answer queries with prefix sums

LeetCode 3918 note: reverse n, take the range [min, max], and sum primes by trial division; test divisibility with %, never by comparing // with /

LeetCode 3917 note: scan right to left counting odds and evens seen; each position’s answer is the count of opposite parity to its right

LeetCode note for Combination Sum IV, rebuilt from the original learning note

LeetCode note for Perfect Squares, rebuilt from the original learning note

LeetCode note for Network Delay Time, rebuilt from the original learning note

LeetCode note for Jump Game, rebuilt from the original learning note

LeetCode note for Jump Game II, rebuilt from the original learning note

LeetCode note for Longest Increasing Subsequence, rebuilt from the original learning note

LeetCode note for Maximum Product Subarray, rebuilt from the original learning note