Notes

My programming notes, cheatsheets, and quick references.

This page contains concise notes that I write while studying competitive programming, artificial intelligence, backend development, mathematics, and software engineering. They are designed to be short, practical, and easy to revisit later.

Home / Notes
Binary Search
July 2026

Binary Search Template

A concise template covering lower_bound, upper_bound, answer binary search, and common pitfalls.

Read Note →
Segment Tree
July 2026

Segment Tree Cheatsheet

Build, update, range query, lazy propagation, and iterative implementation.

Read Note →
Graph Algorithms
June 2026

Graph Algorithms Summary

DFS, BFS, Dijkstra, Topological Sort, Union Find, and MST.

Read Note →
Dynamic Programming
June 2026

Dynamic Programming Patterns

Common DP transitions, optimization ideas, and frequently used templates in programming contests.

Read Note →
Mathematics
May 2026

Competitive Programming Mathematics

Number theory, modular arithmetic, combinatorics, fast exponentiation, and useful formulas.

Read Note →
C++ STL
May 2026

C++ STL Quick Reference

Frequently used STL containers, algorithms, complexity, and handy code snippets.

Read Note →
Machine Learning
April 2026

Machine Learning Cheatsheet

Data preprocessing, model evaluation, cross validation, feature engineering, and practical tips.

Read Note →
Backend
April 2026

Backend Development Notes

REST API design, SQL basics, authentication, deployment, and clean architecture.

Read Note →
← Previous Next →
Keep Learning

Small notes, continuous improvement.

These notes are my personal knowledge base. Whenever I discover a useful algorithm, programming technique, debugging tip, mathematical trick, or engineering practice, I'll add it here for future reference. Hopefully they can also help others learn a little faster.

Read My Blogs