Module 1: Scanline

  • Scanline / Event Processing
  • Problems for practice

Module 2: Introduction to DP

  • Introduction to Dynamic Programming

Module 3: Number theory

  • Prime numbers and factorization
  • Sieve of Eratosthenes

Module 4: Graph traversals

  • Depth-First Search (DFS)
  • Breadth-First Search (BFS)
  • Bipartiteness check
  • Finding connected components
  • Topological sorting

Module 5: Shortest paths

  • Dijkstra's algorithm
  • Floyd–Warshall Algorithm
  • Bellman–Ford algorithm

Module 6: Game Theory - Basics

  • Basics of Game States

Module 7: Introduction to Geometry

  • Signed area of a triangle
  • Basic Geometry
  • Bonus Geometry Problems

Module 8: Various types of Binary Search

  • Binary search by answer
  • Binary search on a real-valued answer
  • Ternary search
  • Binary search by powers of two