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++

## Introduction
Binary Search is an efficient algorithm for finding an item from a sorted list of items. A simple approach is to do a linear search. The time complexity of the linear search algorithm is *O(n)*. Binary Search works in the following manner:
* Search a sorted array by repeatedly dividing the search interval in half. 
* Begin with an interval covering the whole array. 
* If the value of the search `key` is less than the `item` in the middle of the interval, narrow the interval to the lower half. 
* Otherwise, narrow it to the upper half. 
* Repeatedly check until the value is found or the interval is empty.



# Introduction
Binary Search is an efficient algorithm for finding an item from a sorted list of items. A simple approach is to do a linear search. The time complexity of the linear search algorithm is *O(n)*. Binary Search works in the following manner:
* Search a sorted array by repeatedly dividing the search interval in half. 
* Begin with an interval covering the whole array. 
* If the value of the search `key` is less than the `item` in the middle of the interval, narrow the interval to the lower half. 
* Otherwise, narrow it to the upper half. 
* Repeatedly check until the value is found or the interval is empty.



Get introduced to Binary Search, which is the most widely used Divide and Conquer technique.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

Binary Search

Introduction