• 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 Python.
• Operators in Python
  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 - List,Tuples
  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. You will learn about memory representation of lists and tuples, difference between them as well as python specific things such as list slicing and list comprehension.
• 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.

• 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.
• Divide and Conquer
  In this section we will learn about divide and conquer approaches such as quick sort and merge sort.
• 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.
• 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.
• 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.
• 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?
• Dictionary
  It helps us to understand how we can store, search, 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.
• Python Collections Module
  The Collections in python is a module that provides multiple architectures or data structures to store and manipulate the group of objects. Every Structure has its unique use and depending on situation they can be more helpful than built-in data structures such as list, tuple, dictionary,etc.

• 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.
• TOP DP Algorithm
  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.

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

I had an amazing experience here at Coding Blocks. The best thing about coding block is its culture and friendly environment. Coding Blocks provided me the best opportunity to enhance my coding skills.

CB is an excellent place for both refining your skills in a known domain & venturing into a new one. Its well-structured courses & well-informed teachers make the process considerably easy. I am grateful to it for augmenting my skill set.

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.

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. My mentor taught difficult topics in a very simplified manner. During the android course, I was amazed to see the amount of knowledge that my mentors 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.