Advanced Data Structures and Algorithms

Day 1 (3 hours)

1. Advanced Segment Trees (1.5 hours)

2. Persistent Segment Trees (1.5 hours)

Day 2 (3 hours)

1. Fenwick Trees (1.5 hours)

2. Disjoint Set Union (Union-Find) (1.5 hours)

Day 3 (3 hours)

1. Heavy-Light Decomposition (1.5 hours)

2. Mo’s Algorithm (1.5 hours)

Day 4 (3 hours)

1. Persistent Data Structures (1.5 hours)

2. Practice Problems (1.5 hours)

Day 5 (3 hours)

1. Review and Summary (3 hours)