Competitive Programming Course
1. Competitive Programming 
Intro To Competitive Programming
Basics Of Recursion
Time and Space Complexity Analysis
Language Tools
Searching & Sorting Applications
Advanced Recursion
Backtracking
Bit Manipulation
Adhoc Problems
Modulo Arithmetic
Greedy Problems
Segment Tree
Graphs 1
Graphs-2
Advanced Graphs
String Algorithms
Tries
Fenwick Tree
DP & Bitmasking
Number Theory - 1
Applications Of NT - 1
Number Theory - 2
Number Theory - 3
Game Theory
Topics

More About Bitmasking

DP With Bitmasking

Minimum Cost For Jobs

Minimum Cost For Jobs Iteratively

Dilemma Explain

Dilemma Code

Mehta and Bank Robbery - Explain
