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

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

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.

Greatest Common Divisor (Euclid's Algorithm)Check Prime NumberSieve of EratosthenesSieve of Eratosthenes - OptimizedFind Prime Factors of a NumberExtended Euclid's AlgorithmModular Multiplicative Inverse Using EEAChinese Remainder TheoremEuler Phi's FunctionLucas Theorem

Course Assessment

Number Theory

Binary SearchImplementation of Binary SearchFirst and Last Occurrence of an ElementPainter's Partition Problem

Introduction to Greedy AlgorithmsActivity Scheduling ProblemBiased Standing ProblemLoad Balancer ProblemDefense of a Kingdom ProblemGreedy Knapsack ProblemGreedy Knapsack Problem - Implementation

Course Assessment

Greedy Algorithms

Introduction to Recursion & BacktrackingMultiplication Without Using * OperatorTower of HanoiBubble SortMerge SortQuick SortQuick Sort - ImplementationConvert Digits to StringsPhone Keypad ProblemAll Possible Subsequences of a StringN - Queens ProblemN - Queens Problem - ImplementationRat in a Maze ProblemSudoku Solver - Hard Problem

Course Assessment

Recursion and Backtracking

Introduction to Dynamic ProgrammingMinimum Steps to One ProblemMinimum Steps to One Problem - Solution Using Top-Down DPMinimum Steps to One Problem - Solution Using Bottom-Up DPMinimum Coin Change ProblemMinimum Coin Change Problem - Solution Using DPWine and Maximum Price ProblemWine and Maximum Price Problem - Solution Using DPLongest Common SubsequenceProblems Involving Grids - 1Problems Involving Grids - 2Problems Involving Grids - 3Problem Involving Grids - 4Longest Increasing SubsequenceBuilding Bridges Problem - Solution Using LISShortest Common Supersequence of Two StringsEdit Distance Problem0 - 1 Knapsack Problem0 - 1 Knapsack Problem - Optimized SolutionRod Cutting ProblemRod Cutting Problem - Solution Using DPLongest Palindrome SubsequenceLongest Palindrome Subsequence - Solution Using DP

Introduction to GraphsGraph RepresentationAdjacency List Representation - ImplementationGraph Traversal - Breadth-First SearchBreadth-First Search - ImplementationCycle Detection Using Breadth-First SearchGraph Traversal - Depth-First SearchTopological Sorting Using DFSFind the Number of Connected Components in a GraphWhat Are Minimum Spanning Trees?Minimum Spanning Tree - Kruskal's AlgorithmMinimum Spanning Tree - Prims's AlgorithmDijkstra's Algorithm

Join more than 1.6 million learners from companies like

COURSE BY:

Harsh Jain

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers