Why should you do this course?
Enquire at - 9999579111
Click here
Starting from ₹ 1425/-
Key Highlights
FAANG Course as Bonus
200+ Hand Picked Questions
4/6 Months Course Duration
Certificate of Excellence/Completion
Placement assistance
Syllabus- Welcome aboard
Welcome to the course - Vector
In this section we will learn about the container vectors which are same as the dynamic arrays with the ability to resize itself automatically.Since its a container it contains various functions which come quite handy while solving the problems. - Strings
In this section we will learn about strings which is an alternative to character array, String data type helps in handling string easier and faster.With proper understanding of OOPs this concept becomes more clear. - List
In this section we learn about the STL Lists which is based on the data structure Linked List which store data in a non-contiguous manner. - Stacks
In this section we learn about the STL stacks which is based on the data structure Stacks which follows the principle of Last In and First Out. - Queues
In this section we learn about the STL queue which is based on the data structure Queue which follows the principle of First In and First Out. This data structure works just like a normal queue does and it is mainly used as a helping data structure in Trees and Graphs. - Maps
In this section we will learn about Maps which stores the data in the mapped form of key->value which is implement on the basis of Red Black Trees. - Priority Queue
In this section we will learn about the STL priority queue which is primarily based on heaps which helps us understand how the infinite stream of data coming can be accessed to fetch the useful information, for example, find the most sold products on any website? - Set
In this section we will learn about Sets which are internally implemented through BST which store unique elements following a specific order. - Functions
In this section we will learn about various functions that are there in the STL which help us in solving various problems easily like find, sort etc.
- Policy based Data Structures
In this section we will learn about the some data structures that are not part of the STL but are supported by the GCC. These data structures can be designed for high-performance, flexibility, semantic safety, and conformance to the corresponding containers in std. - Tries
It helps us to search in constant time and incase you want to use auto suggestions features of Amazon, Flipkart or other sites search bar this is the solution. Many problems such as Maximum-Xor, and Maximum Sum etc. uses tries to help improve complexity of the problem. - Persistent Tries
In this section we will understand the concept of persistency in tries. - Binary Search
This is where you learn how being greedy can benefit you to solve certain problems in a faster way. The main point of focus here is to understand where we can apply Greedy over Dynamic Programming. - Greedy Algorithms
In this section, we will understand how Bitwise operators like AND, OR, XOR, and NOT work on machine code to help and write programs that works faster. This concept is also very useful in Recursion as well as in Dynamic programming and Advanced DSA. - Bit Manipulation
In this section we will understand about geometry and problems related to them and about convex hull. - Geometry And Convex Hull
TIn this section we will understand about geometry and problems related to them and about convex hull. - Hashing
It helps us to understand how we can store, update and delete the data in constant time. It is majorly used in Dynamic Programming and Graphs to help us make the time complexities of the algorithms better. - Square Root Decomposition/Mo's Algorithm
In this section we will learn about Sqrt Decomposition which is a method (or a data structure) that allows you to perform some common operations (finding sum of the elements of the sub-array, finding the minimal/maximal element, etc.) in optimal time. - String Matching Algorithm
In this section we will learn about various string matching algorithm such as KMP Algorithm, Z-Algorithm etc. - Heavy Light Decomposition
In this section we will learn about Heavy-light decomposition which allows us to effectively solve many problems that come down to queries on a tree. - Fast Fourier Transform
IIn this section we will learn about Fast Fourier Transform and its application in using problem solving. - Game Theory
In this section we will understand a new approach to deal with sequential game problems. - Interactive Problems
In this section we will learn about interactive problems and how to approach them and how they are different. - Theorems
In this section we will learn various theorams such as Totient,Fermat Little Theoram, Miller Theoram, Wilson Theoram etc.
- Basics
Inorder to understand Recursion we must understand Recursion, so this is what is focussed here i.e. write codes using Recursion. It is used in Dynamic Programming and as well as in data structure such as Trees, Graphs, and Heap etc. - Implementation Based
This section will be more focussed on the implemention of various problems using recursion. - Quick Thinking
In this section we will learn we will combine what we have learned up until now and try to solve other difficult problems. - Subset Based
In this section, we will understand how to solve algorithms such as phone search and advanced concept of Knapsack that is mostly asked in Interviews. - Backtracking
It is the most important concept to understand in Recursion and it is thoroughly checked in Interviews and Technical Rounds. If one has to master recursion they need to master backtracking. - Advanced Backtracking
In this section we will try to solve much more difficult problems based on backtracting and implementation.
- Segment Trees
In this section we will learn about segment trees which are the used to store information about intervals/segments which in turn help us querying which of the stored segments contain a given point. - Lazy Propagation
In this section we will learn to optimise our segment trees problems using lazy propagation. - Persistent Segment Trees
In this section we will understand the concept of persistency in segment trees. - Fenwick Trees
In this section we will learn about the binary indexed tree/fenwick trees which predominantly is used to efficiently update elements and calculate prefix sums in a table of numbers.
- Basics
We learn how we can improve the time complexities of Recursive algorithms drastically using concepts like Top Down approach. Also we convert out Top down approach to bottom up approach using the recurrence relation and DP concept, it's exactly what is required for the master DP. - One Dimentional DP
In this section we will go through the DP problems dealing in One Dimention. - Grid Based DP and Two Dimentional DP
The most important concepts of DP are Knapsack, Optimal Game strategy, and solving string problems using 2D storage there by improving their complexities multiple folds. - Multidimentional DP
In this section we will go through the DP problems involving Multi-Dimention. - Atcoder DP Set
In this section we will go through all the problems of the famous atcoder dp contest. - Longest Increasing Subsequence(Many Ways)
In this section will will understand the famous DP problem using different technique.
- Introduction
In this section we will learn about graphs as a non linear data structure and learn about its basic implementations and definitions. - Traversals(BFS and DFS)
In this section we will learn the various ways of traversal across graphs through algorithm like bfs and dfs. - Undirected Graph
In this section we will learn about undirected graphs and various algorithms regarding them. - Directed Graph
In this section we will learn about directed graphs and various algorithms regarding them. - Disjoint Set Union
In this section we will learn about Disjoin set and Union as a powerful tool in solving various graph related problems. - Minimum Spanning Trees
In this section we will get a brief idea about mst and various algorithms regarding them such as Prism's and Krushkal. - Shortest Path Algorithms (Dijkstras, Bellman Ford etc)
In this section we will learn about shortest path algorithms on a weighted graphs such as Dijkstras, Bellman Ford and also Floyd Warshall Algorithm. - Implicit Graphs/ Splitwise Algorithm
In this section we will learn about splitwise app implementation and Algorithm. - Network Flow
In this section we will learn about various network flow and various advance algorithms such as Ford Fulkerson Algorithm, Minimum cut in a network flow. - LCA
In this section we will learn about LCA, Articulation Points and Bridges. - Problem Set
In this section we will go through all the concepts we have learned so far and use them in advance problems related to them.
- Top Tech Company Questions
Practise from the most asked questions in companies such as Amazon, Facebook, Microsoft, LinkedIn, and Google etc. Become the programmer to crack any of your dream company. - Google, Amazon, GoJek, Flipkart, Uber, Amex Interview mantras
This will give you an idea of how you should prepare yourself for the final interviews and prepare yourself for everything that you may face during the placement process of any company.
Projects
Snakes Game
This project uses Arrays to build a very interesting Snake game
Splitwise App
This project uses concepts of DSA to build Splitwise App
Sudoku
Make your very own Sudoku solver with Backtracking
Travel Planner
Plan your travel when you build your own application by using Graphs
Mario
Use DP optimisation to build this all time favourite game and be a leader in your pack
Jump Froggy
Design your very own Frog game while using Greedy optimisation in DSA
Choose Batch
Classroom Batch
Live Batch
Online BatchClassroom Batch
3-4 months duration and 200+ Handpicked questions
Priority Placement assistance & Doubt support
Personal mentoring, progress tracking and feedback
Certificate of Excellence/Completion
Free Wildcraft bag, Swags and access to Online course Developer CV and In-class HackathonsCourses
Starts 22 Dec'24
Master Competitive Programming
This course includes
Detailed theory & exhaustive coverage of problems
Personal mentoring, progress tracking & Feedback
3-4 months duration- Certificate of Excellence/Completion
Priority Doubt Support- Placement assistance
Free Backpack
Free access to Online Course
Basic DSA/coding knowledge required
Live Batch
3-4 months duration, 30+ Live interactive classes and 200+ Handpicked questions Priority Placement assistance & Doubt support Personal mentoring, progress tracking and feedback Certificate of Excellence/Completion Developer CV and In-class HackathonsCourses
Online Batch
Highly Economical model to learn
190+ hours Exhaustive content and Tech enabled Guided learning
6 months duration, 200+ questions and 6 live projects Live interactive booster classes of difficult topics Certificate of Excellence/Completion Progress tracking and feedback Optional Priority Placement assistance & Doubt supportCourses
Starts 1 Dec'24
Competitive Programming
Apaar Kamal
Choose Type
194+ Hours Online Lectures
Topic Based Assignments
Covers Foundation, Basic and Advanced modules
Priority Doubt SupportStarts 1 Jan'25
Competitive Programming
Apaar Kamal
Choose Type
Starts 1 Dec'24
Graph Algorithm Course
Prateek Narang
Choose Type
Master every concept of GraphStarts 1 Jan'25
Graph Algorithm Course
Prateek Narang
Choose Type
Starts 1 Dec'24
Dynamic Programming - Must Do Problem Set
Choose Type
Starts 1 Jan'25
Dynamic Programming - Must Do Problem Set
Choose Type
Starts 1 Dec'24
Dynamic Programming
Prateek Narang
Choose Type
Starts 1 Jan'25
Dynamic Programming
Prateek Narang
Choose Type
Why choose Coding Blocks
Learn and grow as a developer with our project based courses.
Superb Mentors
Best in class mentors from top Tech schools and Industry favourite Techies are here to teach you.
Industry-Vetted Curriculum
Best in class content, aligned to the Tech industry is delivered to you to ensure you are a darling of the Tech industry.
Project Based Learning
Hands on learning pedagogy with live projects to cover practical knowledge over theoretical one.
Superb Placements
Result oriented courses with placement across all genres, students as well as Working professionals.
Inspirational Success stories of CB Alumni
where hard work and determination meets victory!
Hii I am Sidharth Bansal from Delhi technology university. I have done competitive boot camp from coding blocks. This gave me a great exposure to problem solving mindset. I was select for GSOC 2018 at Public lab , Ruby on rails as my technological stack. Now getting an internship from good company was my next goal. So, by the tips and tricks explained by the team, I was easily able to crack all the round and grab the internship. I got selected in Amazon for internship. Getting into Google was a Dream. I got great exposure through Amazon interview and used that as a weapon in google interview. After clearing all the rounds I was able to garb my seat at Google intern also. All this was possible by the guidance of coding blocks. I am selected for Full Time Role at Gameskraft. It is the best gaming startup in India. I will love to explosure game development. It is really important to know different domains of Software Engineering in initial years of career as explained by him. Now at present I am GCI Admin at Public lab. Thank you cb for your love and support.
My interest in the field of competitive coding as well as data structures and algorithms increased during the summer training in Coding Blocks. I loved the way how the entire team used to explain any algorithm. The intricacies of algorithms and how they reduce the complexity of program has always intrigued me. I think that coding blocks gave me the important base of coding.
Competitive Programming is one of the most extensive course of coding blocks. It was a challenging and fun loving experience for me. I owe my success to my mentor and the great course.
I have been taught by best mentors at Coding Blocks. My crystal clear concepts, as well as familiarity with data structures, enabled me to crack Magicpin, Goibibo, and Zomato internships. I interned at Zomato in Summer 2019. I was offered a PPO at Zomato on the basis of performance during my internship tenure. Launchpad was my first course at Coding Blocks. After completing the course, I was very much familiar with DS and Algorithms. I practiced difficult topics in a very simplified manner. During the android course, I was amazed to see the amount of knowledge my mentor had in Android Development. After completion of android app development, I was able to make a few apps currently having 10k+ downloads. Few months after completing my Android Course, I became the TA of Online Android Batch at Coding Blocks. The best part of Coding Blocks is the quality of mentors and the experience that they have. Now, I can say that Coding Blocks has been the most crucial factor in shaping my career.
Couldn't have landed a better job, if it weren't for Coding Blocks.
Still in doubt? We are here to help you out!
Top placements from these programs 
Placement Assistance
A dedicated Placement team along with Hiring Blocks, the placement portal of Coding Blocks work round the clock to ensure the best of opportunities in the Tech arena are available to you.
Developer CV and Dev. Profile Preparation
Interview Preparation
150+ Partner Companies for Placements and Internships
Mock Interviews
Learning cycle
What an inspiration to all!
MentorsCoding Blocks has some of the best mentors in the Industry who will remain by your side during your Preparation for teaching, guidance and assistance.
Kartik MathurAcademics head and Founding member
Mosina AshrafSenior Instructor and Product engineer
Mayank JhaInstructor and Product engineer
Monu Kumar Senior Instructor and Product engineer
Your Code Buddies!
A wide network of TAs aka Teaching assistants, who are typical ex-students of Coding Blocks helps in Doubt resolution along with Mentors, through Video, Audio, Screen share and other media to ensure all your queries are addressed timely
Industry Coaches
Industry experts are guides currently working in Top companies like Google, Amazon, Microsoft and the like and they helps students with invaluable tips on the Industry, Hiring process, Mock interviews and other necessities required for paving the way into the Top Tech companies around the globe.
Tech Established Learning!
The e-learning portal is an in-house developed, state of the art application which uses the best of technology and resources to ensure all learners gain the maximum from their program. It provides immersive learning with suggestions and guidance to ensure even self learning is effective and fruitful. This portal allows learning through ebooks, videos, notes while allowing learners to attempt coding problems, MCQ assignments with attending live classes and asking doubts through chat and live video calling feature with mentors and TAs.
See what students have to say
Manali Biswas
My mentor taught a lot of concepts very well in such a short time. He also solved my doubts even after the course completion. I really loved to solve each question in the class and also those that were given as homework. This course really gave me a head start to my coding journey. I remember the day when I was just travelling somewhere when I spotted the Dwarka center. I never knew it would play such a big role in my learning process. Thanks a lot to Coding Blocks!
Simarpreet Sikka
Coding Blocks has helped me develop strong base in competitive programming. Algo++ and CP bootcamp helped me crack Tech Giant Microsoft with much ease.
Shadma Siddiqui
Coding Blocks is the best place to strengthen your concepts in programming and the course content is structured in a very proper way. Also, the environment will keep you motivated throughout. The TA support will help you whenever you are stuck. The one thing i loved the most was the way how my mentor cleared our concepts. No matter how many doubts you have they are always available to your support from online to offline. If it were'nt for Coding Blocks I would not be placed this early. Thank you CODING BLOCKS!!
Aman Bansal
I really enjoyed the environment CB provided. Not only was I intrigued by the depth of knowledge of the people at CB but I was also pushed and motivated to learn things to the same level as them. I also took the Online Competitive Coding course which certainly was the course that got me through the GS interview and Online Rounds. I can't thank my mentors enough for creating such an awesome course. I can't help but say that CB helped me raise the bar which I had set for myself when it comes to coding and learning.
Srishti Kohli
I'm extremely thankful to Coding Blocks for making competitive coding a cakewalk! My mentors were wonderful teachers and mentors. The course content is clear and complete. I will forever be grateful for the guidance.
Rajat Gupta
Coding Blocks has always helped me connect with talented people around. As a campus superhero, I have been in touch with my mentors, both of whom have never failed to guide me and my peers in achieving the best!
Mahima
My coding journey started at Coding Blocks. I was a student of Launchpad C++ course and it helped me in grabbing a great understanding of data structures and algorithms and improved my problem solving skills as well. I'd like to thank Coding Blocks for all the help and support :)
Dhruv Agarwal
If you have time for only 1 course to pick, go for interview prep. Skills acquired to time spent ratio is amazing. Thanks to my mentors and the team I was able to crack the majority of online rounds and interviews. The teaching style of them made me understand DSA effortlessly.
Anshuman Diwaker
I had an amazing time learning Data Structures and Algorithms(JAVA) at Coding Blocks. The mentorship and curriculum covered by my mentor was excellent. I would revert back to the lectures every time i needed to revise my concepts again. Concepts taught in JAVA were also very useful during my Internship. Thus it was a great learning curve for me.
Dhriti Saini
I built my foundation of Data Structures and Algorithms during the Launchpad C++ course which helped me develop interest in coding and problem solving. Thank you to the CB mentors who guided us.
Dhiraj Kumar Jain
The course made my basics very clear and the assignments and questions gave him ample practice for the interviews . I am very much thankful to my mentor for his guidance and continued support . The techniques explained my him in the course proved very much helpful to me in the interviews . I am thankful to Coding Blocks for making such a course which helped me ace in my interviews.
Anshul Mittal
Coding Blocks helped in gaining enough experience to get internships at giants like Google and Rubrik.
See a class in action!
Classroom Classes
Online Classes
Live Classes
Frequently Asked Questions
Learn and grow as a developer with our project based courses.
-
What is Classroom program?
Coding Blocks has physical centers in Delhi and Noida. Classroom program batches are conducted in these physical centers where you learn in a class with your peers and mentors, much like the way you do in College or University with a difference that you get to have personal attention by the mentor. Batch size is extremely limited and Course completion is complete for all learners. This is the most successful program in terms of Success or placements.
-
What is Live interactive program?
Live interactive program is a perfect replacement to the Classroom program. In a live interactive course, classes are conducted in a controlled environment, where the mentor teaches and students can interact with the mentor, much like a classroom. The only difference is that the mentor is not physically present in front of you. This model allows you to learn from the mentor of your choice, transcending boundaries and is economical as compared to the Classroom program.
-
What is Online Self paced program?
Self paced Online programs are guided learning courses driven by our state of the art e-learning portal. These programs carry the same legacy as our Classroom programs. In order to reinforce learning and assist students, we have made our Self paced Online programs “HYBRID”, meaning we have added Live classes of topics where we feel students need interaction with mentors. In addition, students can clear their doubts through Video calls or Chats with our mentors and TAs. If learners stay close to our centers, they can even visit our Physical centers and meet the mentors in person to resolve their doubts.
-
I took Online Self paced program but now I feel I need to switch to Classroom program because that is how I have been always learning. Can I shift my batch from one mode to another?
If you are facing trouble with any model and want to make a switch, please get in touch with the Coding Blocks Support team for assistance. If need be, we will help you transition from one model to another.
-
I am confused on which mode of learning to opt, Classroom, Live interactive or Online?
The three models of learning are very different in nature and suits different learners basis individual preferences. We would recommend you to connect to our counsellors who can guide you well on which program and model best suits your needs.
-
I will have doubts while studying. How are they addressed?
Doubts are addressed by your Mentors and Teaching assistants who are always there to help you in your program. Doubts can be addressed in person, over live video calls, live chats and screen sharing sessions, pair coding sessions, Slack channels and Whatsapp groups, in addition to our portal where your doubts are also addressed. Don’t worry, we got your back.
-
How can I get Teaching Assistant (TA) role after completing my course with Coding Blocks?
Once you complete your course, you need to apply for the position of TA in Coding Blocks. Your application will be screened, you will be interviewed and tested on Coding problems and then you will be roped in. As Coding Blocks alumni, you will get priority.
-
How can I get Placement and Internship assistance from Coding Blocks?
A dedicated Placement team along with Hiring Blocks, the placement portal of Coding Blocks work round the clock to ensure the best of opportunities in the Tech arena are available to you.There are more than 150 companies who have partnered with Coding Blocks for hiring our students.
-
I am studying in College and planning to do this course? Will I be able to cope up with the Work load?
Most of the learners at Coding Blocks are College students only. All our courses and curriculum, across Classroom, Live interactive and Online self paced models are created to ensure you can learn while studying in your college.
-
Will I get Certificate of completion after this course?
Yes, you will get Certificate of completion once you complete the course. Completion of course depends on how much content has been completed, together with how many assignments have been completed. If you are a dedicated and hard working learner, you can also bag our Certificate of excellence.
-
I have already done a course from Coding Blocks. Am I eligible to get some discounts as an Alumni?
Our Alumni is our family. We definitely would be more than thrilled to have you back, as this is really common for us. And yes, we would be happy to offer you exciting concessions on fee. We would recommend you to connect to our counsellors who can guide you well on this.