Share Description
In this course, you will learn :
- Discover various Algorithms related to Number Theory.
- Divide and Conquer and Greedy Algorithms should be used.
- Learn how to solve problems involving recursion and backtracking.
- Solving problems will help you grasp the concept of Dynamic Programming.
- Graph-related Algorithms should be implemented.
- Become a member of our Premium Discussion Group.
Syllabus :
1. 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
3. Divide and Conquer
- Binary Search
- Implementation of Binary Search
- First and Last Occurrence of an Element
- Painter's Partition Problem
4. 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
5. Recursion and 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
- Rat in a Maze Problem
- Sudoku Solver - Hard Problem
- Recursion and Backtracking
6. Dynamic Programming
- Introduction to Dynamic Programming
- Longest Common Subsequence
- Problems Involving Grids
- Longest Increasing Subsequence
- Shortest Common Supersequence of Two Strings
- Longest Palindrome Subsequence
- Longest Palindrome Subsequence - Solution Using DP
7. 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
