• 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.

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 Hackathons

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 Hackathons

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 support

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.

landscape

landscape

landscape

landscape

landscape