The ultimate guide to coding interviews. Developed by FAANG engineers. Boost problem-solving skills with number theory, dynamic programming, and graph theory. Get interview-ready in just a few hours.

Competitive Programming - Crack Your Coding Interview.png

Whether you’re gearing up for online coding challenges, code-a-thons, or interviews, then this course is for you. With this course, you will solidify your problem-solving skills ensuring a swift sail through any problem. 


You will be tasked with solving some of the most frequently asked questions that are brought up in FAANG interviews. You will start with the concepts of Number Theory and Divide and Conquer, and gradually move towards more complex problems like dynamic programming and graph theory.


With each problem you solve, there will be insightful explanations and full implementation details to really hammer home the concepts. By the time you finish this course, you will have the confidence to solve any problem, no matter the difficulty.

Competitive Programming - Crack Your Coding Interview, C++

## Who should take this course?
This course aims to help you crack coding interviews. If you are a beginner, this course is not for you. You should be familiar with the following to take this course: 

* Any programming language
* C++ Standard Template Library (*If you love to code in some other language, you should be familiar with basic data structures like arrays, maps, etc.*)
* Usage of classes and objects
* Logical thinking

## What you’ll learn in this course
This course focuses on advanced topics asked in many coding interviews. We will start with the concepts of Number Theory and gradually move towards more complex problems like Dynamic Programming, Graph Theory, etc. This course dives straight into actual coding interview problems and the algorithms behind those problems without wasting any time.


Details about the course and its prerequisites.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

Introduction to the Course

Who should take this course?