Introduction

Agendas

This is sorted by latest, if you wish to learn from the beginning, please start from the oldest one

3. Recursion and Tree

• Recursion
• Tree

2. Bitmap, Queue, and Stack

• Bitmap
• Queue
• Stack

1. Bloom Filter, Cryptographic Hash, and Hash Table

• Bloom Filter
• Cryptographic Hash
• Hash Map

0. Big O Notation, Set, and Hash Function

• Set

Planned

• Dynamic Programming, Greedy
• BFS, Maze Generator
• Interpreter Design
• Union Disjoint Set, Heap, Fenwick Tree