Competitive Programming - Self Paced (original) (raw)
-1669185704.svg)
210k+
interested Geeks
Master Competitive Programming with our comprehensive course covering all CP concepts, Contests, and Intensive problem-solving techniques.
Beginner to Advanced
26 Weeks
Assessment testsComprehensive LearningBeginner FriendlyCourse Certificate
Your next rating jump starts here — are you in?
Course Overview
Why Competitive Programming ?:
- Enhances problem-solving and analytical skills
- High demand in finance, data science, and engineering
- Global competitions to showcase talent
Why This Course:
- 60+ hours of recorded lectures
- 100+ problems (Easy, Medium, Hard)
- GeekBlitz challenges for real-time coding
- Covers DSA concepts & CP basics for beginners
- Intensive problem-solving for pro-coders
- 24x7 doubt support
Join Now to Learn, Solve, and Code!
Read more 
Course Content
01CP Prerequisite
- CP & Algortithms : Importance & Motivation of CP, Time and Space Complexities, Analysis of Common Techniques
- DSA Part I : Arrays, Matrix, Recursion, Hashing, String, Searching & Sorting
- DSA Part II : Stack, Queue & Deque, Tree, BST, Heap, Graph, Greedy & Backtracking
- DSA Part III : Dynamic Programming, Trie, Segment & Binary Indexed Tree & Disjoint Set
02CP Basics & Number Theory
- Basics : Solving First Competitive Programming Problem, Ranges of input And Output, Tricks For CP, Floating Point Format, etc
- Number Theory I : Bit Masking, Fibonnaci Numbers, Divisors, Prime Factorization, Prime Numbers
- Number Theory II : GCD & LCM, Mathematical Principles, Number Theoretic Functions, Binomial Coefficients
- Number Theory III : Catalan Number, Modular Arithmetic, Modular Exponentiation, Combinatorial Game Theory, Geometric Algorithms, Miscellaneous Problems
- GeekyBlitz - Contest A, Contest B and Contest C
03Recursion and Backtracking
- Recursion : Generate all the balanced string of parentheses for given length, Generate all passwords of given length, Number of Paths in a Grid, Binomial Coefficient, Text Pattern Matching, etc
- Backtracking : Sudoku Problem, N-Queen, Rat in a Maze, The Knight's tour, etc
- GeekyBlitz - Contest D
04Divide and Conquer
- Binary Search : Binary Search in CP, Faster Implementation of BS and Concept of Invariants, Need for Monotonic function and practice problems
- Ternay Search : Ternary Search concept, Need for Parabolic Curve, Counting Inversions using Merge Sort, Minimum Range Problem, Peak in a rotated array, etc
- GeekyBlitz - Contest E
Read more
What Sets Us Apart
Recognised Certification
Earn an industry-recognized GeeksforGeeks Training Certificate for credible validation, career advancement, and lifetime
Testimonials
The course of Competitive Programming helped me a great deal in building my skills in Competitive coding. The instructor of the course made the whole ...
Being part of the GeeksforGeeks community is an incredible experience. The Competitive Programming course of GeeksforGeeks is an exceptional program t...
This course of Competitive Programming helped me a lot in building my skills in Competitive coding. My whole journey in the course was so smooth and k...
GFG has been my one-stop destination during my preparation, from DSA to all the computer science fundamental courses like Operating systems, OOPs, etc...
The competitive programming course has helped me improve my problem-solving ability comprehensively. The instructor and the TA support has been phenom...
I would like to thank Sandeep Sir for providing us with well-curated content and problems in the course of data structure and algorithms. He explained...
Frequently Asked Questions
01
Is there any number to contact for query?
02
How does the admission process work for this course?
03
How long will the course content be available for?
04
Can I make the payment through PayPal?
05
How doubt support feature works?
06
What language support do I get in this course?