Complete Competitive Programming Beginner to Intermediate Level Course
Module 1 - 2500 BDT
Basic C/C++ and Problem Solving
C/C++
Basic I/O
C/C++Operators ( +, -, *, /, &, |, ^ )
Conditions ( if/else )
Loops ( for, while, do-while )
Array/Strings
Greedy
Bruteforce
Functions
Constructive
Built-in functions in both C and C++
STL - FREE
Standard Template Library
Vector
String
Pair
Map
Set
Multiset
Stack
Queue
Deque
Priority Queue
Module 2 - 2500 BDT
Basic Algorithms, Data structures, and Problem-Solving techniques
Partial Sum
Sliding windows Range Sum Query
Contribution Technique
Policy-Based Data structure
Bit masking
Recursion
Structure
Structure Sorting
Pointer
Sorting ( Bubble, Insertion )
Binary Search
Upper bound / Lower bound
Integer Bisection
Fractional Bisection
Module 3 - 1500 BDT
Number Theory
Harmony Series
Prime Generation
Sieve of Erythrose
Prime Factorization
Number of Divisors
Euler Phi Function
Sum of divisors
Modular arithmetics
Level 1 - 1500 BDT
STL, binary search, pbds & Number theory
STL
Binary Search (6 Classes)
Policy Based Data Structure
Number Theory
Level 2 - 500 BDT
Basic Graph Theory and Dynamic Programming
Basics of Graph theory
Adjacency matrix, Adjacency list, and tree
Depth-first search (DFS)
Breadth-first search (BFS)
The shortest path on the unweighted graph
Basics of Dynamic programming
0-1 knapsack
Coin change
Dp solution print
Level 3 - 1200 BDT
Graph Theory / Dynamic Programming
Intermediate-level graph theory
Dijkstra
Belman ford
Floyd warshal
Disjoint set union
Minimum spanning tree
Intermediate-level Dynamic Programming
Longest Common subsequence
Longest Increasing subsequence in both dp and binary search
Bitmask DP, Digit DP
Intermediate level Data structure
Segmentree
Lazy Propagation
Merge sort tree