Linear Search Binary Search Ternary Search bubble Sort Selection Sort Insertion Sort Merge Sort Quick Sort Heap Sort Counting Sort Radix Sort Bucket Sort Shell Sort Primality Test Sieve of Eratosthenes Applications of Sieve Binary Exponentiation GCD (Euclidean Algorithm) Modulo Arithmetic Modulo Multiplicative Inverse Mastering Recursion Factorial & Fibonacci Backtracking Rat in a maze Subset Sum N-Queens Extended Euclidean Algorithm Euler's Totient Function Segmented Sieve Linear Diophantine Equation Chinese Remainder Theorem Inclusion-Exclusion Principle Matrix Multiplication Matrix Exponentiation Solving Recurrence relations Fermat’s Little Theorem Miller-Rabin Primality (Pattern Matching) Sliding window Rolling Hash Rabin-Karp Knuth-Morris-Pratt (KMP) Z-Algorithm Activity Selection Fractional Knapsack Job Scheduling Introduction Graph Representation Breadth-First Search (BFS) Depth-First Search (DFS) BFS & DFS in 2D Grid Connected Components Bi-Partite Graph Test Cycle detection Finding Diameter of a graph In/Out Time & DFS Tree Bridges In Graph Articulation Points Topological Sort Basics of DP 0/1 Knapsack Rod Cutting Longest Increasing Subsequence (LIS) Coin Change Subset Sum Longest Common Subsequence (LCS) Edit Distance Matrix Chain Multiplication Trie Aho-Corasick Suffix Array Suffix Tree Longest Palindromic Substring (Manacher’s) Introduction Minimum Spanning Tree Strongly Connected Components (SCC) Dijkstra's algorithm for shortest path Bellman-Ford Algorithm Lowest Common Ancestor Distance b/w two nodes in O(logn) Max Flow Introduction Ford-Fulkerson Algorithm for Max-Flow Edmonds-Karp Algorithm for Max-Flow Advanced DP Intro Digit DP Bit Masking DP DP on Tree Into Subtree Size in O(N) Merge Smaller Into Bigger in / Out DP