Competitive Programming Live

Become a PRO in 8 Weeks


Coding Blocks is pleased to bring you the ultimate competitive programming course, hand crafted to ensure your success in challenges such as Google CodeJam, Google Kickstart, ACM-ICPC, and more. This 8 week programme will kickstart your foray in to the exciting world of competitive coding. You will master commonly used problem solving techniques, hone your mathematical analysis skills, and push the boundaries of your reasoning abilities. The course will cover Advanced Data Structures like Segment Trees, Binary Index / Fenwick Trees. You shall learn construct algorithms involving Dynamic Programming, Bitmasking, Greedy Algorithms, and Divide & Conquer. The course will also cover other advanced competitive topics. This course is for all the coders who are looking forward to optimizing their problem-solving process, and learn new algorithmic skills which will help them to solve problem quickly.

There is a total of 100+ video resources, and weekly problem-solving live sesisons in this bootcamp. The bootcamp starts on September 30.

Maths & Number Theory

We will cover various Number Theory Topics like Prime Sieve, Segmented Sieve, Euler's Totient Fn, Chinese Remainder Theorem etc along with Maths Topics like Birthday Paradox Problem, Pigeonhole Principle, Inclusion-Exclusion Principle and much more.

DP and Graphs

In the bootcamp, you will learn to solve problems using Dynamic Progamming. You will also learn to solve Graph problems using DP and Graph Algorithms. Dynamic Programming is the most important topic from the view of most exams.

Greedy Problems

The bootcamp will cover a variety of questions based on Greedy Strategy. You will learn when to apply greedy technique and then DP.

Game theory & Segment Trees

You will learn the basic concepts of Game Theory(like Nim Game) and apply those concepts to solve problems. Segment Trees an important data structure for solving problems will also be covered. You will learn to optimise your ST using Lazy Propagation.


WeekTopics Covered
September 30STL
October Week 1Number Theory, Maths
October Week 2Recursion, Backtracking, Bitmasking, Tries
October Week 3Divide & Conquer, Dynamic Programming, Greedy Algorithms
October Week 4Advanced Dynamic Programming, DP with Bitmasks
November Week 1Graphs, Advanced Graphs
November Week 2Segment Tree, BIT, Lazy Propagation, Fenwick Tree, Offline Queries
December Week 1Game Theory, Geometric Algorithms
December Week 2Advanced Topics


Prateek Mugshot

Prateek Narang
is passionate about teaching, Prateek is a CS graduate from DTU. He has previously worked with SanDisk, HackerEarth. He has also won various hackathons including Google’s Code For India, Smart City Hackathon, qualified ACM-ICPC regionals and published papers in International Journals. His interactive CV ( is also popular in 120+ countries.

Deepak Mugshot

Deepak Aggarwal
Popular for his creative thinking style, Deepak tries to offer creative solutions to problems. He is a strong competitive programmer, had qualified for ACM-ICPC Regionals, won the International Problem Solving Competition by Dyalog APL. He likes to spend his free time reading.

Get the Mastering Competitive Programming Module

Mastering Competitive Programming Handbook by Coding Blocks

To enhance your experience even further, we shall send you the ultimate competitive programming handbook by Coding Blocks at the end of the course, free of charge. The book contains all the material covered in this bootcamp.


(Drop a line at [email protected] if you have further queries)

  • Who should do this bootcamp?

    Recommended for student who are good data structures and algorithms and want to learn more new concepts and tricks used in Competitive Coding can do this bootcamp.

  • Which programming language will be used in Bootcamp?

    Although, the idea of the bootcamp is to teach you new concepts, we will be using C++ for the codes shared. More focus will be on logic and algorithms. Students who know Java/Python can also do this bootcamp and implement the same logic in the language they prefer.

  • What are the pre-requisites for this bootcamp ?

    You should have good knowledge of basics(like sorting,searching, recursion ) and data-structures ( stacks, queues, linked lists, hashing, heaps, trees, graphs) along with space-time complexity analysis on problems.

  • Will this improve my ranking in Online Competitions ?

    Yes, definitely. The bootcamp will teach you new concepts and tricks and will help you become smarter with solutions.

  • Will I get Coding Blocks Competitive Programming Module for studying ?

    Yes, you will get a copy of Coding Blocks Competitive Programming Module for study and assignments.

Come, fall in LOVE with CODING

Batches Starting September 30!
Come get the competitive edge.
Use Code: SUPERCODER to get extra Rs. 2000 off!

Online code Submission & Evaluation
5 HackerBlocks Contests
Regular Batch

(75+ Videos, 10 Live Sessions)

Enroll Now

Contact Us
Call(Toll-free): 1800-2744-504


What our students say

Competitive programming
★ ★ ★ ★ ★

I joined C++ course in coding blocks,pitampura. It has been a wonderful experience since then. Course content is well structured and taught at a nice pace with ample questions covered in class. Assignments given contain good questions both in quality and quantity.

competitive programming
★ ★ ★ ★ ★

Went through the competitive programming bootcamp, the syllabus was precise and i gained exposure to various tricks and tips to solve the competitive programming questions. Altogether it was a learning experience which i found very helpful :)

competitive programming
★ ★ ★ ★ ★

I did the Competitive Programming BootCamp and I can say that the course was excellent. The teachers made even the toughest of topics looks easy and I recommend it to anyone who's looking to improve their Algorithmic skills

competitive programming
★ ★ ★ ★ ★

The best part of it was that they actually taught more than they mentioned in the curriculum without affecting the quality of the content being taught. As told, 80–100 questions were given in assignments, the faculty was available after and before the classes and was very friendly.