These are the study notes for Advanced Algebra II, covering the learning material of Chapter 3: Linear Transformation Theory.

These are the study notes for Advanced Algebra II, covering the learning material of Chapter 2: Vector Spaces and Linear Maps.

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

These are the study notes for Advanced Algebra II, covering the learning material of Chapter 1: Polynomial Theory.

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 article only records some of the more classic conclusions from the Advanced Algebra I course, without including detailed notes and proofs.

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…

These are study notes for Introduction to Computation A (Experimental Class), which record Monads and related content in Haskell.

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