HomeCoursesCompetitive Programming - Crack Your Coding Interview, C++

Intermediate

15h

Updated 5 months ago

Competitive Programming - Crack Your Coding Interview, C++
Save

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.

Join 2.7 million developers at

Overview

Content

Reviews

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.

Whether you’re gearing up for online coding challenges, code-a-thons, or interviews, then this course is for you. With this cour...Show More

WHAT YOU'LL LEARN

Learn about various Algorithms related to Number Theory

Implement Divide and Conquer and Greedy Algorithms

Learn how to solve Recursion and Backtracking problems

Understand the concept of Dynamic Programming by solving problems

Implement various Algorithms related to Graphs

Get access to our Premium Discussion Group

Learn about various Algorithms related to Number Theory

Content

76 Lessons1 Quiz3 Assessments

Overview

1 Lessons

Get familiar with coding interview prep, advanced C++ topics, and problem-solving techniques.

Introduction to the Course

Number Theory

10 Lessons

Get started with efficient algorithms for GCD, prime checking, factorization, and number theory applications.

Greatest Common Divisor (Euclid's Algorithm)

Check Prime Number

Sieve of Eratosthenes

Sieve of Eratosthenes - Optimized

Find Prime Factors of a Number

Extended Euclid's Algorithm

Modular Multiplicative Inverse Using EEA

Chinese Remainder Theorem

Euler Phi's Function

Lucas Theorem

Number Theory

Assessment

Divide and Conquer

4 Lessons

Break apart the concepts of Binary Search, element occurrence, and partition problems efficiently.

Binary Search

Implementation of Binary Search

First and Last Occurrence of an Element

Painter's Partition Problem

Greedy Algorithms

7 Lessons

Apply your skills to solve optimization problems using greedy algorithms and their applications.

Introduction to Greedy Algorithms

Activity Scheduling Problem

Biased Standing Problem

Load Balancer Problem

Defense of a Kingdom Problem

Greedy Knapsack Problem

Greedy Knapsack Problem - Implementation

Greedy Algorithms

Assessment

Recursion and Backtracking

14 Lessons

Take a closer look at recursive and backtracking techniques through sorting and problem-solving tasks.

Introduction to Recursion & Backtracking

Multiplication Without Using * Operator

Quick Sort - Implementation

Convert Digits to Strings

Phone Keypad Problem

All Possible Subsequences of a String

N - Queens Problem

N - Queens Problem - Implementation

Rat in a Maze Problem

Sudoku Solver - Hard Problem

Recursion and Backtracking

Assessment

Dynamic Programming

23 Lessons

Focus on using dynamic programming for solving optimization problems, from Fibonacci to knapsack.

Introduction to Dynamic Programming

Minimum Steps to One Problem

Minimum Steps to One Problem - Solution Using Top-Down DP

Minimum Steps to One Problem - Solution Using Bottom-Up DP

Minimum Coin Change Problem

Minimum Coin Change Problem - Solution Using DP

Wine and Maximum Price Problem

Wine and Maximum Price Problem - Solution Using DP

Longest Common Subsequence

Problems Involving Grids - 1

Problems Involving Grids - 2

Problems Involving Grids - 3

Problem Involving Grids - 4

Longest Increasing Subsequence

Building Bridges Problem - Solution Using LIS

Shortest Common Supersequence of Two Strings

Edit Distance Problem

0 - 1 Knapsack Problem

0 - 1 Knapsack Problem - Optimized Solution

Rod Cutting Problem

Rod Cutting Problem - Solution Using DP

Longest Palindrome Subsequence

Longest Palindrome Subsequence - Solution Using DP

Graphs

13 Lessons

Build on graph concepts, representations, traversals, cycle detection, topological sorting, MSTs, and shortest paths.

Introduction to Graphs

Graph Representation

Adjacency List Representation - Implementation

Graph Traversal - Breadth-First Search

Breadth-First Search - Implementation

Cycle Detection Using Breadth-First Search

Graph Traversal - Depth-First Search

Topological Sorting Using DFS

Find the Number of Connected Components in a Graph

What Are Minimum Spanning Trees?

Minimum Spanning Tree - Kruskal's Algorithm

Minimum Spanning Tree - Prims's Algorithm

Dijkstra's Algorithm

Bonus Lessons

4 Lessons

Learn how to use advanced techniques in bit-masking, segment trees, and unique number identification.

Introduction to Bit-masking

Find the Unique Number

Introduction to Segment Trees

Where to Go Next ?

Certificate of Completion

Showcase your accomplishment by sharing your certificate of completion.

Course Author:

Harsh Jain

Developed by MAANG Engineers

Every Educative resource is designed by our team of ex-MAANG software engineers and PhD computer science educators — subject matter experts who’ve shipped production code at scale and taught the theory behind it. The goal is to get you hands-on with the skills you need to stay ahead in today's constantly evolving tech landscape. No videos, no fluff — just interactive, project-based learning with personalized feedback that adapts to your goals and experience.

Trusted by 2.7 million developers working at companies

"These are high-quality courses. Trust me. I own around 10 and the price is worth it for the content quality. EducativeInc came at the right time in my career. I'm understanding topics better than with any book or online video tutorial I've done. Truly made for developers. Thanks"

Anthony Walker

@_webarchitect_

"Just finished my first full #ML course: Machine learning for Software Engineers from Educative, Inc. ... Highly recommend!"

Evan Dunbar

ML Engineer

"You guys are the gold standard of crash-courses... Narrow enough that it doesn't need years of study or a full blown book to get the gist, but broad enough that an afternoon of Googling doesn't cut it."

Software Developer

Carlos Matias La Borde

"I spend my days and nights on Educative. It is indispensable. It is such a unique and reader-friendly site"

Souvik Kundu

Front-end Developer

"Your courses are simply awesome, the depth they go into and the breadth of coverage is so good that I don't have to refer to 10 different websites looking for interview topics and content."

Vinay Krishnaiah

Software Developer

Hands-on Learning Powered by AI

See how Educative uses AI to make your learning more immersive than ever before.

Instant Code Feedback

Evaluate and debug your code with the click of a button. Get real-time feedback on test cases, including time and space complexity of your solutions.

AI Mock Interviews

Test your skills in a simulated interview setting. Receive personalized feedback based on your performance. Available for Coding Interviews, System Design, and more.

Adaptive Learning

At various checkpoints throughout Educative courses, you will be prompted to take a quick assessment. Receive a condensed curriculum tailored to your strengths and skill gaps.

Explain with AI

Select any text within any Educative course, and get an instant explanation — without ever leaving your browser.

AI Code Mentor

AI Code Mentor helps you quickly identify errors in your code, learn from your mistakes, and nudge you in the right direction — just like a 1:1 tutor!

Course

Recursion for Coding Interviews in Java

The ultimate guide to recursion interviews with strategies developed by FAANG engineers. Practice with real-world interview questions, detailed explanations, and visualizations to prep faster.

6 h

intermediate

Course

Recursion for Coding Interviews in C++

The ultimate guide to recursion interviews. Developed by FAANG engineers, practice with real-world C++ problems, interactive code playgrounds, and get interview-ready in just a few hours.

3 h

intermediate

Course

The Complete Java Crash Course

Gain insights into Java, a versatile and portable programming language. Delve into similarities with C++ and Python and learn essential Java-specific features with practical coding examples.

6 h

intermediate

Course

Collections in Java

Gain insights into Java Collections Framework. Delve into lists, sets, and hashmaps. Learn about data modification, sorting, thread-safety, and internal workings for efficient usage.

5 h

intermediate

Course

Learn REST and SOAP API Test Automation in Java

Gain insights into performing REST and SOAP API test automation, writing API and integration tests from scratch, and preparing for test automation interviews with a downloadable framework.

3 h

intermediate

Course

Java Unit Testing with JUnit 5

Gain insights into configuring and utilizing JUnit 5 for Java unit testing. Learn about writing effective unit tests, integrating assertions, assumptions, parameterized tests, and their significance.

5 h

intermediate

Course

Design a Test Automation Framework with Selenium and Java

Delve into designing a test automation framework using Java and Selenium. Learn about Selenium basics, TestNG, build management, logging, and reporting to automate web applications effectively.

12 h

beginner

Course

Initializing Data Members: From C++11 till C++20

3 h

beginner

Course

Recursion for Coding Interviews in Java

intermediate

6 hour

Course

Recursion for Coding Interviews in C++