• DAA Tutorial
  • DAA Algorithm
  • Need of Algorithm
  • Complexity of Algorithm
  • Algorithm Design Techniques
  • Asymptotic Analysis
  • 6. Asymptotic Analysis
  • Analyzing Algorithm Control Structure
  • Recurrence
  • 8. Recurrence Relation
  • Recursion Tree Method
  • Master Method
  • Analysis of Sorting
  • 11. Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Divide and Conquer 1
  • 4. Introduction
  • Max-Min Problem
  • Binary Search
  • Merge Sort
  • Tower of Hanoi
  • Sorting
  • 19. Binary Heap
  • Quick Sort
  • Stable Sorting
  • Lower bound Theory
  • 22. Lower bound Theory
  • Sorting in Linear Time
  • 23. Linear Time
  • Counting Sort
  • Bucket Sort
  • Radix Sort
  • Hashing
  • 27. Hashing
  • Hash Tables
  • Hashing Method
  • Open Addressing Techniques
  • Hash Function
  • Binary Search Trees
  • 32. Binary Search
  • Red Black Tree
  • Dynamic Programming
  • 34. Dynamic Programming
  • Divide & Conquer Method vs Dynamic Programming
  • Fibonacci sequence
  • Matrix Chain Multiplication
  • Matrix Chain Multiplication Example
  • Matrix Chain Multiplication Algorithm
  • Longest Common Sequence
  • Longest Common Sequence Algorithm
  • 0/1 Knapsack Problem
  • DUTCH NATIONAL FLAG
  • Longest Palindrome Subsequence
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Tabulation vs Memoization
  • How to solve a dynamic programming problem
  • Optimal Substructure Property
  • Overlapping sub-problems
  • Dynamic programming vs Greedy approach
  • Regular Expression Matching
  • Branch and bound vs backtracking
  • Branch and bound
  • Longest Repeated Subsequence
  • Longest Common Substring
  • Shortest Common Supersequence
  • Dynamic Programming vs Divide and Conquer
  • Maximum Sum Increasing Subsequence
  • Wildcard Pattern Matching
  • Largest Sum Contiguous Subarray
  • Shortest Sum Contiguous Subarray
  • Dynamic programming vs Backtracking
  • Brute force approach
  • Fractional vs 0/1 knapsack problem
  • Traveling Salesperson problem using branch and bound
  • Integer Partition Problem
  • Kruskal Algorithm
  • Traveling Salesperson problem using branch and bound
  • Greedy Algorithm
  • 70. Greedy Algorithms
  • Activity Selection Problem
  • Fractional Knapsack problem
  • Huffman Codes
  • Algorithm of Huffman Code
  • Activity or Task Scheduling Problem
  • Travelling Sales Person Problem
  • Dynamic Programming vs Greedy Method
  • Backtracking
  • 78. Backtracking Introduction
  • Recursive Maze Algorithm
  • Hamiltonian Circuit Problems
  • Subset Sum Problems
  • MST
  • 82. MST Introduction
  • MST Applications
  • Kruskal’s Algorithm
  • Prim’s Algorithm
  • Shortest Path
  • 86. Introduction
  • Negative Weight Edges
  • Representing Shortest Path
  • Relaxation
  • Dijkstra’s Algorithm
  • Bellman-Ford Algorithm
  • Single Source Shortest Path in a Directed Acyclic Graphs
  • All-Pairs Shortest Paths
  • 93. Introduction
  • Floyd-Warshall Algorithm
  • Johnson’s Algorithm
  • Maximum Flow
  • 96. Flow networks and Flows
  • Network Flow Problems
  • Ford Fulkerson Algorithm
  • Maximum Bipartite Matching
  • Sorting Networks
  • 100. Comparison Network
  • Bitonic Sorting Network
  • Merging Network
  • Complexity Theory
  • 103. Complexity Classes
  • Polynomial Time Verification
  • NP-Completeness
  • Circuit Satisfiability
  • 3-CNF Satisfiability
  • Clique Problem
  • Vertex Cover Problem
  • Subset-Sum Problem
  • Approximation Algorithm
  • 111. Introduction
  • Vertex Cover
  • Travelling Salesman Problem
  • String Matching
  • 114. Introduction
  • Naive String Matching Algorithm
  • Rabin-Karp-Algorithm
  • String Matching with Finite Automata
  • Knuth-Morris-Pratt Algorithm
  • Boyer-Moore Algorithm
  • Misc
  • 120. Kosaraju Algorithm
  • Hashing Algorithm
  • Dijkstra’s Algorithm
  • Huffman Coding Algorithm
  • Kadane’s Algorithm
  • Dijkstra Algorithm Example
  • Euclidean Algorithm
  • Floyd’s Algorithm
  • Properties of Algorithm
  • Time Complexity of Kruskal’s Algorithm
  • Travelling Salesman Problem
  • Kosaraju’s Algorithm
  • Floyd-Warshall Algorithm
  • Characteristics of an Algorithm
  • Algorithm Examples
  • Searching Algorithms
  • Algorithm for Binary Search
  • Sorting Algorithms: Slowest to Fastest
  • Extended Euclidean Algorithm
  • How to Write an Algorithm