ZONE 01 : Basics
PHASE 01UPCOMING

Intro to Programming

0/1 COMPLETE
PHASE 02UPCOMING

Learn a Language

0/10 COMPLETE
PHASE 03UPCOMING

Intro to Competitive Programming

0/1 COMPLETE
PHASE 04UPCOMING

Bitwise Thinking

0/1 COMPLETE
PHASE 05UPCOMING

Complexity Analysis

0/2 COMPLETE
PHASE 06UPCOMING

Recursion

0/1 COMPLETE
PHASE 07UPCOMING

Very Basic Math

0/3 COMPLETE
PHASE 08UPCOMING

Range Queries Without Updates

0/2 COMPLETE
PHASE 09UPCOMING

Standard Template Library (STL)

0/11 COMPLETE
PHASE 10UPCOMING

Leveraging Monotonicity

0/2 COMPLETE
PHASE 11UPCOMING

Basic Sorting Algorithms

0/8 COMPLETE
PHASE 12UPCOMING

Divide and Conquer

0/1 COMPLETE
PHASE 13UPCOMING

Greedy and Constructive

0/2 COMPLETE
PHASE 14UPCOMING

2D Prefix Sum

0/1 COMPLETE
PHASE 15UPCOMING

More Techniques

0/2 COMPLETE
PHASE 16UPCOMING

Bit Manipulation

0/2 COMPLETE
PHASE 17UPCOMING

Basic Modular Arithmetic

0/2 COMPLETE
PHASE 18UPCOMING

Basic Counting

0/3 COMPLETE
PHASE 19UPCOMING

Very Basic Graphs

0/1 COMPLETE
ZONE 02 : Data Structures (DS)
PHASE 01UPCOMING

Segment Tree

0/13 COMPLETE
PHASE 02UPCOMING

Binary Indexed Tree (BIT)

0/5 COMPLETE
PHASE 03UPCOMING

Sparse Table

0/3 COMPLETE
PHASE 04UPCOMING

Trie

0/2 COMPLETE
PHASE 05UPCOMING

Disjoint Set Union (DSU)

0/8 COMPLETE
PHASE 06UPCOMING

Square Root Decomposition

0/12 COMPLETE
PHASE 07UPCOMING

Heavy Light Decomposition (HLD)

0/1 COMPLETE
PHASE 08UPCOMING

Centroid Decomposition

0/2 COMPLETE
PHASE 09UPCOMING

Long Path Decomposition

0/1 COMPLETE
PHASE 10UPCOMING

BST

0/1 COMPLETE
PHASE 11UPCOMING

Balanced Binary Search Tree (BBST)

0/5 COMPLETE
PHASE 12UPCOMING

Link Cut Tree (LCT)

0/4 COMPLETE
PHASE 13UPCOMING

Policy Based Data Structures

0/2 COMPLETE
PHASE 14UPCOMING

More Tree Data Structures

0/6 COMPLETE
PHASE 15UPCOMING

Dynamic Connectivity

0/2 COMPLETE
PHASE 16UPCOMING

Monotonic Data Structures

0/4 COMPLETE
PHASE 17UPCOMING

Miscellaneous

0/4 COMPLETE
PHASE 18UPCOMING

Techniques

0/7 COMPLETE
ZONE 03 : Graph Theory
PHASE 01UPCOMING

Graph Traversal

0/7 COMPLETE
PHASE 02UPCOMING

Lowest Common Ancestor (LCA)

0/2 COMPLETE
PHASE 03UPCOMING

Graph Connectivity

0/9 COMPLETE
PHASE 04UPCOMING

Orientation

0/2 COMPLETE
PHASE 05UPCOMING

Minimum Spanning Tree (MST)

0/9 COMPLETE
PHASE 06UPCOMING

Shortest Paths

0/11 COMPLETE
PHASE 07UPCOMING

Cycles

0/5 COMPLETE
PHASE 08UPCOMING

More Tree Stuff

0/7 COMPLETE
PHASE 09UPCOMING

Satisfiability

0/3 COMPLETE
PHASE 10UPCOMING

Eulerian Path

0/1 COMPLETE
PHASE 11UPCOMING

Hamiltonian Path

0/2 COMPLETE
PHASE 12UPCOMING

Cliques and Independent Sets

0/2 COMPLETE
PHASE 13UPCOMING

Graph Coloring

0/5 COMPLETE
PHASE 14UPCOMING

Graph Counting

0/5 COMPLETE
PHASE 15UPCOMING

Dynamic Acyclic Graphs (DAG)

0/2 COMPLETE
PHASE 16UPCOMING

Dominators

0/1 COMPLETE
PHASE 17UPCOMING

Special Graphs

0/3 COMPLETE
PHASE 18UPCOMING

Flow and Min Cut

0/13 COMPLETE
PHASE 19UPCOMING

Matching

0/8 COMPLETE
PHASE 20UPCOMING

Partially Ordered Set (POSET)

0/1 COMPLETE
PHASE 21UPCOMING

Miscellaneous

0/5 COMPLETE
ZONE 04 : Number Theory
PHASE 01UPCOMING

Primes and Divisors

0/12 COMPLETE
PHASE 02UPCOMING

Multiplicative Functions

0/7 COMPLETE
PHASE 03UPCOMING

Euclidean Algorithm

0/4 COMPLETE
PHASE 04UPCOMING

Modular Arithmetic

0/10 COMPLETE
PHASE 05UPCOMING

Linear Diophantine Equations

0/5 COMPLETE
PHASE 06UPCOMING

Solutions to Equations

0/6 COMPLETE
PHASE 07UPCOMING

Floor Sum

0/3 COMPLETE
PHASE 08UPCOMING

Fibonacci Numbers

0/4 COMPLETE
PHASE 09UPCOMING

Miscellaneous

0/6 COMPLETE
ZONE 05 : Combinatorics
PHASE 01UPCOMING

Techniques

0/1 COMPLETE
PHASE 02UPCOMING

Catalan

0/2 COMPLETE
PHASE 03UPCOMING

Inclusion Exclusion

0/3 COMPLETE
PHASE 04UPCOMING

Factorials and Binomial Coefficients (nCr)

0/8 COMPLETE
PHASE 05UPCOMING

Stirling Numbers

0/5 COMPLETE
PHASE 06UPCOMING

Partitions

0/2 COMPLETE
PHASE 07UPCOMING

Miscellaneous

0/3 COMPLETE
ZONE 06 : Math
PHASE 01UPCOMING

Convolution

0/7 COMPLETE
PHASE 02UPCOMING

Polynomial

0/22 COMPLETE
PHASE 03UPCOMING

Matrices

0/6 COMPLETE
PHASE 04UPCOMING

Linear Recurrence

0/8 COMPLETE
PHASE 05UPCOMING

Linear Algebra

0/18 COMPLETE
PHASE 06UPCOMING

Formulas

0/4 COMPLETE
PHASE 07UPCOMING

Calculus

0/2 COMPLETE
PHASE 08UPCOMING

Probabilities and Expected Values

0/6 COMPLETE
PHASE 09UPCOMING

Mathematical Optimization

0/3 COMPLETE
PHASE 10UPCOMING

Miscellaneous

0/3 COMPLETE
ZONE 07 : Strings
PHASE 01UPCOMING

String Matching

0/4 COMPLETE
PHASE 02UPCOMING

Hashing

0/4 COMPLETE
PHASE 03UPCOMING

Aho Corasick

0/2 COMPLETE
PHASE 04UPCOMING

Suffix Structures

0/6 COMPLETE
PHASE 05UPCOMING

Palindromes

0/5 COMPLETE
PHASE 06UPCOMING

Longest Common Subsequence (LCS)

0/5 COMPLETE
PHASE 07UPCOMING

Miscellaneous

0/5 COMPLETE
ZONE 08 : Dynamic Programming (DP)
PHASE 01UPCOMING

Intro to DP

0/2 COMPLETE
PHASE 02UPCOMING

Digit DP

0/1 COMPLETE
PHASE 03UPCOMING

DP Optimizations

0/5 COMPLETE
PHASE 04UPCOMING

Convex Hull Trick (CHT)

0/2 COMPLETE
PHASE 05UPCOMING

Li Chao Tree

0/3 COMPLETE
PHASE 06UPCOMING

Bit Related DP

0/6 COMPLETE
PHASE 07UPCOMING

More Tricks

0/4 COMPLETE
PHASE 08UPCOMING

Classic DP

0/3 COMPLETE
PHASE 09UPCOMING

Dp on Different Structures

0/4 COMPLETE
PHASE 10UPCOMING

Miscellaneous

0/5 COMPLETE
ZONE 09 : Game Theory
PHASE 01UPCOMING

Grundy Number / Nim

0/2 COMPLETE
PHASE 02UPCOMING

Hackenbush

0/2 COMPLETE
PHASE 03UPCOMING

Graph Games

0/2 COMPLETE
PHASE 04UPCOMING

Miscellaneous

0/1 COMPLETE
ZONE 10 : Geometry
PHASE 01UPCOMING

Euclidean Geometry

0/1 COMPLETE
PHASE 02UPCOMING

Geometry 2D

0/24 COMPLETE
PHASE 03UPCOMING

Geometry 3D

0/9 COMPLETE
PHASE 04UPCOMING

Delaunay

0/1 COMPLETE
PHASE 05UPCOMING

Half Plane

0/2 COMPLETE
PHASE 06UPCOMING

Convex Polygon

0/3 COMPLETE
PHASE 07UPCOMING

Lattice Points

0/2 COMPLETE
PHASE 08UPCOMING

Sweep Line

0/5 COMPLETE
PHASE 09UPCOMING

Planar Geometry

0/2 COMPLETE
PHASE 10UPCOMING

Miscellaneous

0/6 COMPLETE
ZONE 11 : Miscellaneous
PHASE 01UPCOMING

Greedy Algorithms

0/4 COMPLETE
PHASE 02UPCOMING

Search Techniques

0/4 COMPLETE
PHASE 03UPCOMING

Interactive Problems

0/2 COMPLETE
PHASE 04UPCOMING

Permutations

0/3 COMPLETE
PHASE 05UPCOMING

Matroids

0/1 COMPLETE
PHASE 06UPCOMING

Chess

0/3 COMPLETE
PHASE 07UPCOMING

Techniques

0/9 COMPLETE
PHASE 08UPCOMING

Min Plus Convolution

0/2 COMPLETE
PHASE 09UPCOMING

Randomized

0/2 COMPLETE
PHASE 10UPCOMING

Bigint

0/2 COMPLETE
PHASE 11UPCOMING

Miscellaneous

0/9 COMPLETE