Sharing insights about competitive programming, algorithms, and software development
A comprehensive guide to the thinking process for Tree DP in competitive programming: how to decide if a problem needs Tree DP, how to invent states and transitions, when rerooting is needed, and how to debug it effectively.
Complete black-box guide to Suffix Arrays for competitive programming. Includes implementation, LCP array, pattern matching, distinct substrings, and common contest applications with ready-to-use code templates.
Master Suffix Automaton: a compressed DFA of all substrings. Learn how to count distinct substrings, find occurrences, longest repeated substrings, and solve complex substring problems efficiently with practical recipes and examples.
A practical breakdown of maintaining tree diameter under edge-weight updates using Euler Tour flattening and Segment Tree with lazy propagation, with full C++ implementation.
Get notified when I publish new articles about competitive programming and algorithms.