YoungForest's blog

Four solutions greedily load crates, count power-of-two meal pairs, split an array with two boundaries, and map a target before finding an LIS.

A biweekly contest review covers queue and waiting-time simulation, greedy binary-string changes, and two-pointer swaps for consecutive ones.

Contest solutions compare string halves, prioritize expiring apples, trace balls through a maze, and query maximum XOR with a binary trie.

Contest solutions use one-pass token parsing, hashed pairing, shift-and-modulo concatenation, and greedy bounds with pruned backtracking.

Contest solutions sum wealth, preserve a subsequence with a monotonic stack, count complementary moves by intervals, and minimize deviation by halving.

A review of thesis work, remote internship, job hunting, coding practice, and delayed graduation in 2020, followed by goals for 2021.

Contest solutions concatenate string arrays, greedily build a minimal string, balance parity sums, and order tasks to minimize initial energy.

Contest solutions implement an ordered stream, compare character-frequency sets, and preserve the longest middle segment; problem four is unfinished.

A biweekly review covers circular arrays, split points, bounded BFS and subset DP; the last two were solved correctly only after contest timeouts.

Four solutions build a recurrence array, enforce unique frequencies, sell diminishing ball stacks by layer, and count sorted insertion cost.