5-6 months duration, 350+ questions and 6 live projects

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

60+ live classes, 5-6 months duration, 350+ questions and 6 live projects

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

200+ hours Exhaustive content and Tech enabled Guided learning

6 months duration, 350+ 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

• Welcome aboard
  Welcome to the course
• Flowcharts and Psuedocode
  This helps you to understand how to convert logic and write it in the form of diagrammatic and textual way.
• Basics of Programming
  For any language the first and the most important thing to learn is the syntax, variables, loops, and conditionals. In this section, we will cover how to convert our logic to Java Code.
• Operators in JAVA
  To help you understand different types of operators such as Arithmetic, Compund assignment, Bitwise, and Logical operators.
• Functions
  In this section, you will learn to write code in a modular way to help you reuse the code in different C++ files and make it more readable and organized.

• Arrays
  This is the one of most important data structure that is generally easy to understand but algorithms and concepts of this topic can be very tricky and it is asked in almost every tech company.
  Algorithms such as Binary Search, Sorting, Maximum Subarrays, and Searching are must to do in order to get a good grasp of this topic.
• Bitmasking
  In this section, we will understand how Bitwise operators like AND, OR, XOR, and NOT to work on machine code to help write the programs that works faster, since computer understands machine code.
  This concept is also very useful in Recursion as well as Dynamic programming advanced concepts.
• Strings
  It's an alternative to Character Array, Strings data type helps in handling string easier and faster.vIn depth understanding of this concept becomes easier after understanding OOPs concepts.
• ArrayList
  In Java, ArrayList class uses a dynamic array for storing the elements. It is like an array, but there is no size limit.

• Recursion Introduction
  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.
• Deep Diving into recursion
  In this section, we will start exploring how to form recurrence relations using problem statements and mainly discussing recursion on arrays and strings.
• Recursion on Subsets
  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.
• Time and Space Complexity
  It helps us to compare the algorithms on the basis of Time and Space it takes to run the code and help us to master how to write codes by considering constraints of the problem.

• Object Oriented Programming
  One of the most important topic to build data structures, this is not only used in every data structure but also help us to understand how to associate the real world with programming language.
• Stack
  It follows the principle of Last In and First Out, although this data structure can be easily understood but the concept of LIFO can be used to solve some typical problems such as Histogram Area, Stock Span, and Balanced Parantheses etc.
• Queues
  This data structure works just like a normal queue does and it is mainly used as a helping data structure in Trees and Graphs.
• Linked List
  In this topic we learn how to store data in a non-contiguous manner and we understand how the Linked List can work in a better time complexity that other data structures in some operations.
• DeQueue
  It will help you in the Interview questions based on Sliding Window.

• Binary Trees and Binary Search Trees
  In this data structure, we learn how to store data in a hierarchical format. It is one of the most important topic from Interview point of view and questions from this topic is frequently asked in companies such as Amazon, Microsoft, Flipkart and Google etc.
• Heap
  This data structures helps you to 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?
• Hashmap
  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.
• Graphs
  The most popular data structures in companies like Direct-i, Google, and Arcesium etc.
  It is usually considered tough because of the dependency on other data strucutres such as queue, hashmaps, sets, and heap etc. but once you get a taste of how to apply these things together it will make you a better programmer.
• 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.

• One Dimensional Dynamic Programming
  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.
• Two Dimensional Dynamic Programming
  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.
• DP Algorithms
  Knapsack, LCS, LIS, Matrix Chain Multiplication are amongst the topics/algorithms that one should know to crack top placements.
• Greedy Algorithms
  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.
• Java Collection Framework
  The Collection in Java is a framework that provides an architecture to store and manipulate the group of objects. Java Collections can achieve all the operations that you perform on a data such as searching, sorting, insertion, manipulation, and deletion.

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

• Browser
  What happens when you hit the url on your browser ?What is system Design? Types of System Design HLD intro
• Types of Design && Design Basics
  LLD intro & SDLC Web App VS Website What is architecture
• System types
  Monoliths Distributed System LatencyThroughput
• Android Components
  Availability TIme Consistency
• Characteristics
  Availability Time Consistency
• Storing Hot Data
  Websockets & SSE Scaling Techniques Horizontal Scaling
• Theorams
  Redundancy && Replication Cap theorem Databases
• Division of Data
  DataBase optimization Partitioning Communication
• Communication
  Message Based communication Web Apps Rest Apis
• Microservices
  Microservices & architecture Web Servers && Protocols & App security Service
• Design Problem
  URL Shortener/ Pastebin Api Rate Limiter
• Design Problem
  Youtube Design Web Crawler
• Design Problem
  Drop Box Uber Backend Design
• Design Problem
  Twitter Instagram
• Design Problem
  Ticketmaster design

• Basic Of LLD
  What is LLD? LLD INTERVIEWS
• OOPS
  OOD && OOP Objects && CLASSES
• Design Principles
  OOP CONCEPTS Solid Principle
• Design Principles
  SRP Princripal O-C Principal
• Design Principles
  Livosik Principal
• Design Principles
  Integration Principal
• Design Principles
  Dependency Principal Problems
• Patterns
  Design Patterns
• Design Problems
  Case Studies
• Coding using OOPs
  Machine Coding

"I knew Coding Blocks from my early college days and when it came to becoming a Top programmer, I only trusted the best.

This place is literally like a family. I love the pedagogy and focus on Project based learning.

The Mentors are so awesome and literally guide you so well that the entire pathway becomes crystal clear.

The content is also se well prepared that it covers everything you would ever need to become a top coder. This basically is the best of everything bought together at one place.

Big fan and so proud that I am a CB’ian for life."

"Coding Blocks is the best choice I made in my career.

I always dreamt of making it to the Tech bigwigs and after having a discussion with one of the mentors at Coding Blocks, I decided that I will go with them.

Everyone here is so brilliant, passionate and focussed.

Coding Blocks helped me in becoming an ace coder and then with Mock coding rounds and experienced Industry coaches telling us how to crack various companies.

Wish Coding Blocks all the success in future, big thanks."

"Coding Blocks is the best place to learn coding.

You can feel learning flowing in the air in this place. The way Coding is taught is brilliant, no stress, competitive environment, lots and lots of content and brilliant mentors for students.

Kartik sir is extremely humble and such a brilliant mentor. While learning to code, you see you fault areas, you always have access to Mentors and TAs for doubts, you see your progress live, I must say the way CB has used technology to build the portal and the way they are using it is also impressive. No doubt, so many students realise their dreams of getting into Tech bigwigs after learning from CB.

Kudos to the great and untiring effort of the entire team."

"Choosing Coding Blocks has been one of the best decisions of my life.

I could easy realise this when I first had a talk with my mentor. Teaching methodology, assignments, hackathons, doubt resolution, everything was beyond compare.

We were pushed to explore our limits and this shows us in the success we achieve.

A big thanks to Coding Blocks and Kartik Mathur sir for everything."

"Guidance is the most important aspect in success of an individual. One incorrect path you take and it takes years to correct.

At Coding Blocks, you get the most genuine advice on not just what to do but also how to do along with all the resources and CB stays with you till you are a winner.

It is so good to be in touch with such a great community of super energetic people, all striving towards excellence.

I must say CB has a big role to play in my journey and CB rocks!!"

landscape

landscape

landscape

landscape

landscape