Basic Graph Theory - Trees, DFS, BFS
Target to solve 2-3 problems per day.
Contest Code LP3TO401
Problems 19
Duration 15 Days
Basic Graph Theory II - Shortest Paths
Target to solve 2-3 problems per day.
Contest Code LP3TO402
Problems 8
Duration 8-10 Days
Graphs
Target to solve 2-3 problems per day.
Contest Code LP3TO403
Problems 20
Duration 15 Days
Number Theory - Sieving
Target to solve 2-3 problems per day.
Contest Code LP3TO404
Problems 13
Duration 10 Days
Dynamic Programming - Knapsack
Target to solve 2-3 problems per day.
Contest Code LP3TO405
Problems 8
Duration 8-10 Days
Dynamic Programming
Target to solve 2-3 problems per day.
Contest Code LP3TO406
Problems 34
Duration 20-25 Days
Segment Trees
Target to solve 2-3 problems per day.
Contest Code LP3TO407
Problems 7
Duration 8-10 Days
Modulo Multiplicative Inverse
Target to solve 2-3 problems per day.
Contest Code LP3TO408
Problems 9
Duration 8-10 Days