This is a project I created using Vibe Coding to generate data for algorithm competition problems.

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.

This is my gift to myself as I’ve come of age, and also a memoir of my competitive career as an OI competitor…

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