Competitive Programming - Crack Your Coding Interview, C++

INTERACTIVE COURSE

Competitive Programming - Crack Your Coding Interview, C++

Intermediate

76 Lessons

15h

Certificate of Completion

Competitive Programming - Crack Your Coding Interview, C++

3 Assessments

67 Playgrounds

202 Illustrations

Takeaway Skills

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

Course Overview

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. Wit...Show More

Course Content

1

Overview

Introduction to the Course

2

Number Theory

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

3

Divide and Conquer

Binary Search Implementation of Binary Search First and Last Occurrence of an Element Painter's Partition Problem

4

Greedy Algorithms

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

5

Recursion and Backtracking

Introduction to Recursion & Backtracking Multiplication Without Using * Operator Tower of Hanoi Bubble Sort Merge Sort Quick Sort 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

6

Dynamic Programming

23 Lessons

7

Graphs

13 Lessons

8

Bonus Lessons

4 Lessons

COURSE AUTHOR

How You'll Learn

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Videos are holding you back. Educative‘s interactive, text-based lessons accelerate learning — no setup, downloads, or alt-tabbing required.

Learn faster and smarter with adaptive AI tools embedded in every Educative course.

Built-in assessments let you test your skills. Completion certificates let you show them off.

Recommended Courses

BEFORE STARTING THIS COURSE

AFTER FINISHING THIS COURSE