This paper explores the theory of tree and path neighborhoods, analyzing their union and intersection operations, and presents their practical applications in algorithmic competition problems.

This is my presentation slides for a data structures and algorithms presentation, which introduces the Y-Fast Trie algorithm.

A curated collection of competitive programming problems I have designed, featuring my core insights, solutions, and problem-setting reflections.