LeetCode

LeetCode 671 note: the root is the minimum; the second minimum is the smallest value larger than the root, and only subtrees equal to the root need searching

LeetCode 661 note: each cell becomes the floored average of the existing cells in its 3 × 3 neighborhood, written into a new matrix

LeetCode 657 note: returning to the origin means as many U as D and as many L as R

LeetCode 653 note: traverse while keeping a set of seen values; finding k - val in it means a pair exists

LeetCode 645 note: use sums: missing = sum of 1..n - sum of the set, duplicate = array sum - sum of the set

LeetCode 637 note: level-order traversal, dividing each level’s sum by its count

LeetCode 628 note: after sorting there are only two candidates: the three largest, or the two smallest (negatives) times the largest

LeetCode 606 note: output in pre-order, keeping an empty () when only the left subtree is missing, and omitting the right parentheses when it is empty

LeetCode 605 note: scan left to right and plant in any empty plot whose neighbors are empty; a new flower blocks the next plot, so actually update the array

LeetCode 599 note: map list1’s strings to indices, sum both indices while scanning list2, and keep every string with the minimum sum

LeetCode 598 note: every operation covers the top-left corner, so the most-incremented cells form the intersection of all operations: min(a) × min(b)

LeetCode 594 note: subsequences need not be contiguous, so just count; for each x add the counts of x and x + 1