YoungForest's blog

First-biweekly notes on fixed points, substring index pairs, worker-bike assignments and counting digits across a range.

Late-start contest notes on common string periods, complementary matrix rows, negabinary addition and target-sum submatrices.

Speed-contest notes on sorting, sliding windows, one-swap permutations, priority queues and planning edge cases before coding.

DP-heavy contest notes on colliding stones, adjacent duplicate removal, longest word chains and a classic minimum partition.

A contest recap on bounded robot paths, four-colour garden graphs, maximum-sum partitions, and suffix or binary-search duplicate detection.

An index page linking to the author's review of Effective Modern C++ and its approach to modern C++ practice.

First top-two-hundred contest notes on collinearity, a greater-sum tree, polygon triangulation and moving stones into consecutive slots.

Corner-case contest notes on moving stones, coloring a border, longest common subsequences and escaping a maze by bounding blockers.

Late-start contest notes on distance-ordered cells, two-city scheduling, non-overlapping subarrays and reversing a stream-query tree.

Four solutions move from an odd-even divisor pattern to ancestor extremes, arithmetic subsequences, and rebuilding a tree from preorder depth.