LeetCode

LeetCode note for Number of Dice Rolls With Target Sum, rebuilt from the original learning note

LeetCode note for Profitable Schemes, rebuilt from the original learning note

LeetCode note for Ones and Zeroes, rebuilt from the original learning note

LeetCode note for Form Largest Integer With Digits That Add Up To Target, rebuilt from the original learning note

LeetCode note for Last Stone Weight II, rebuilt from the original learning note

LeetCode 327 note: prefix sums plus merge sort counting with two pointers bounding a range, and a log of retyping it over a dozen times

LeetCode 2392 note: row and column conditions are independent, so run one topological sort for each; put x at its row and column positions, and return an empty matrix if either has a cycle

LeetCode 2102 note: two heaps for “top k” and “the rest”, with a custom lt for reversed string order

LeetCode 1235 note: sort jobs by end time with best[j] = best profit using the first j jobs; taking job j binary-searches the last job ending <= its start

LeetCode 2912 note: many cells, but only four classes relative to the destination (itself, same row, same column, neither); each class’s total moves together in O(k)

LeetCode 60 note: make k 0-indexed; once the first digit is fixed there are (n-1)! arrangements, so k // (n-1)! picks the first digit among those remaining, then repeat for the next position

LeetCode 3873 note: merge points sharing an x or y into components; a new point joins at most two of them, so the answer is the two largest plus 1