YoungForest's blog

Four solutions enumerate square-sum triples, use breadth-first search for the nearest exit, play a two-half sum game, and minimize cost under a time limit.

Four solutions concatenate arrays, count length-three palindromes, colour grids with DP, and merge valid binary search trees.

A three-year master’s retrospective covering study, research, internships, choices, growth, and regrets.

A one-week graduation trip through Linfen, Wuhan, and Suizhou, mixing family visits, trains, local food, humid weather, moving, and the end of campus life.

Four solutions check interval coverage, locate exhausted chalk, find the largest magic square, and minimize the cost of flipping an expression.

LingShen’s big data:

1897,Redistribute Characters to Make All Strings Equal,redistribute-characters-to-make-all-strings-equal,1309.1422268153
1898,Maximum Number of Removable Characters,maximum-number-of-removable-characters,1912.8440554296
1899,Merge Triplets to Form Target Triplet,merge-triplets-to-form-target-triplet,1635.6879273926
1900,The Earliest and Latest Rounds Where Players Compete,the-earliest-and-latest-rounds-where-players-compete,2454.7653333657

Four solutions rotate a matrix, count sorted reductions, minimize flips in a circular alternating string, and reduce packaging waste with prefix sums.

Four solutions convert words to values, insert one digit greedily, schedule servers with priority queues, and use DP to minimize skipped rests.

Four solutions test three distinct characters, pair array extremes, rank rhombus sums, and use bitmask DP for minimum XOR matching.

Four solutions compare binary runs, binary-search speed, update jump ranges once, and use linear DP for the best stone-game score difference.