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

## Factorization of a number problem
Let us now take a problem in which you need to print all the factors of a number. For example, if we have **N = 12**, the output would be the factors of **12**, which are **2, 3**. Look at the visual below to get an idea about the approach that we will be taking.

# Factorization of a number problem
Let us now take a problem in which you need to print all the factors of a number. For example, if we have **N = 12**, the output would be the factors of **12**, which are **2, 3**. Look at the visual below to get an idea about the approach that we will be taking.

Learn to use sieve to find the factors of a given number.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

Find Prime Factors of a Number

Factorization of a number problem