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

## Implementation
We have already discussed the logic in [Greedy Knapsack Problem](https://www.educative.io/courses/competitive-programming-intvw/greedy-knapsack-problem) lesson. Let’s directly jump to the code now.

# Implementation
We have already discussed the logic in [Greedy Knapsack Problem](https://www.educative.io/courses/competitive-programming-intvw/greedy-knapsack-problem) lesson. Let’s directly jump to the code now.

Learn how to implement the solution for the Greedy Knapsack Problem.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

Greedy Knapsack Problem - Implementation

Implementation