YoungForest's blog

Speed-contest notes on outer-parenthesis removal, root-to-leaf accumulation, tall-short pattern matching and greedy clip stitching.

Revisiting digital roots: moving from repeated recursive or iterative sums to a constant-time congruence shortcut.

Routine contest notes on binary-prefix remainders, base negative two, next-greater linked nodes and boundary-first enclave search.

Evening make-up notes on three equal partitions, repeated-unit divisibility, the best sightseeing pair and binary-substring coverage.

A first serious contest round explores selecting a matched training group, placing one new service office and fairly allocating overlapping seat requests.

An introduction to how pkg-config exposes library metadata for headers, compiler flags, linking, and public versus private dependencies.

Contest notes on bit complements, duration pairs, binary-search shipping capacity and counting repeated digits after an unsolved final task.

Speed-contest notes on array negations, clumsy factorial, domino rotations and constructing a search tree from preorder.

Notes after a silent recording attempt: common characters, repeated substitutions, sliding windows and interval DP for merging stones.

Late-start contest notes on trust relationships, four-direction searches, maximum binary trees and efficient grid illumination.