Competitive Programming - Crack Your Coding Interview, C++

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

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 as... See More

How You'll Learn

Hands-on coding environments

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.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

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

Hands-on coding environments

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.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

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

Course Contents

Hide All

Hide All Lessons

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

Course Assessment

Number Theory

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

Course Assessment

Greedy Algorithms

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

Course Assessment

Recursion and Backtracking

6. Dynamic Programming

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

7. Graphs

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

8. Bonus Lessons

Introduction to Bit-masking

Find the Unique Number

Introduction to Segment Trees

Where to Go Next ?