Properties of Asymptotic Notations [Abdul Bari]

Introduction to Algorithms [Abdul Bari]

Growth Functions & Asymptotic Notations [MUNR]

Iterative Time Complexity [MUNR]

Recursive Time Complexity [MUNR]

Master Theorem [MUNR]

Priori Analysis and Posteriori Testing [Abdul Bari]

Characteristics of Algorithm [Abdul Bari]

How to Write and Analyze Algorithm [Abdul Bari]

Frequency Count Method [Abdul Bari]

Time Complexity [Abdul Bari]

Time Complexity Example [Abdul Bari]

Time Complexity of While and If [Abdul Bari]

Classes of Functions [Abdul Bari]

Compare Class of Functions [Abdul Bari]

Asymptotic Notations — Big Oh, Omega, Theta [Abdul Bari]

Asymptotic Notations — Big Oh, Omega, Theta [Abdul Bari]

Comparison of Functions [Abdul Bari]

Comparison of Functions [Abdul Bari]

Best, Worst and Average Case Analysis [Abdul Bari]

Asymptotic Notations — Simplified [Abdul Bari]

Recurrence Relation — Decreasing, T(n-1)+1 [Abdul Bari]

Recurrence Relation — Decreasing, T(n-1)+n [Abdul Bari]

Recurrence Relation — Decreasing, T(n-1)+log n [Abdul Bari]

Recurrence Relation — Decreasing, 2T(n-1)+1 [Abdul Bari]

Masters Theorem — Decreasing Function [Abdul Bari]

Recurrence Relation — Dividing, T(n/2)+1 [Abdul Bari]

Recurrence Relation — Dividing, T(n/2)+n [Abdul Bari]

Recurrence Relation — Dividing, 2T(n/2)+n [Abdul Bari]

Masters Theorem — Dividing Function [Abdul Bari]

Examples for Master Theorem [Abdul Bari]

Root Function — Recurrence Relation [Abdul Bari]

Searching Algorithms & Problem Solving [MUNR]

Searching Algorithms [MUNR]

Binary Search — Iterative [Abdul Bari]

Binary Search — Recursive [Abdul Bari]

Linear Search [Farhan]

Binary Search [Farhan]

Comparison Based Sorting [MUNR]

Count Sort & Merge Sort [MUNR]

Quick Sort [MUNR]

Heap, Heap Sort & Heapify [Abdul Bari]

Two Way Merge Sort — Iterative [Abdul Bari]

Merge Sort Algorithm [Abdul Bari]

Merge Sort — In-depth Analysis [Abdul Bari]

Quick Sort Algorithm [Abdul Bari]

Quick Sort Analysis [Abdul Bari]

Merge Sort Algorithm — Hindi [Abdul Bari]

Bubble Sort [Farhan]

Insertion Sort [Farhan]

Selection Sort [Farhan]

Quick Sort [Farhan]

Merge Sort [Farhan]

Heap — Binary Array Representation [Farhan]

Max Heap & Min Heap [Farhan]

Heap Sort [Farhan]

Counting Sort [Farhan]

Radix Sort [Farhan]

Karatsuba Algorithm [MUNR]

Divide and Conquer [Abdul Bari]

Strassen's Matrix Multiplication [Abdul Bari]

Tower of Hanoi [Abdul Bari]

Graph Introduction [HFN]

Graph — Second Class [HFN]

Graph Lecture [HFN]

Graph — DFS [HFN]

Graph — Cycle & Topological Sort [HFN]

Graph — SCC & DSU [HFN]

DFS — Theory & Code [FHZ]

DFS — Connected Components [FHZ]

BFS — Theory & Code [FHZ]

BFS — Shortest Path [FHZ]

DFS — Timestamps & Edge Classifications [FHZ]

DSU — Disjoint Set Union [FHZ]

Independent Set & Bipartite Graphs [FHZ]

Topological Sorting [FHZ]

Graph Introduction & Representation [MUNR]

BFS & Bipartite Graph Detection [MUNR]

DFS & Edge Classification [MUNR]

Edge Classification — Solved Example [MUNR]

Cycle Detection using DFS [MUNR]

Topological Sorting & SCC [MUNR]

Kosaraju's Algorithm [MUNR]

Disjoint Sets Data Structure [Abdul Bari]

Graph Traversals — BFS & DFS [Abdul Bari]

Articulation Point & Biconnected Components [Abdul Bari]

BFS & DFS — Simplified [Abdul Bari]

Topological Sort [Farhan]

Dijkstra Algorithm [FHZ]

Bellman-Ford [FHZ]

Dijkstra [MUNR]

Dijkstra — Single Source Shortest Path [Abdul Bari]

Bellman-Ford — Dynamic Programming [Abdul Bari]

All Pairs Shortest Path — Floyd-Warshall [Abdul Bari]

Shortest Path Algorithms — Simplified [Abdul Bari]

Dijkstra's Algorithm — Undirected [Farhan]

Dijkstra's Algorithm — Directed [Farhan]

Bellman-Ford Algorithm [Farhan]

Floyd-Warshall Algorithm [Farhan]

MST, DSU & Kruskal [HFN]

Minimum Spanning Tree [FHZ]

MST & Kruskal's Algorithm [MUNR]

Minimum Spanning Tree [MUNR]

Prim's & Kruskal's Algorithms [Abdul Bari]

Minimum Spanning Tree [Farhan]

Kruskal's Algorithm [Farhan]

Prim's Algorithm [Farhan]

MST & Huffman Coding [HFN]

Greedy Algorithms [FHZ]

Fractional Knapsack [FHZ]

Huffman Coding [FHZ]

Greedy Approach, Huffman Encoding & Interval Scheduling [MUNR]

Fractional vs 0/1 Knapsack [MUNR]

Fractional vs 0/1 Knapsack [MUNR]

Greedy Method — Introduction [Abdul Bari]

Knapsack Problem — Greedy [Abdul Bari]

Job Sequencing with Deadlines — Greedy [Abdul Bari]

Optimal Merge Pattern — Greedy [Abdul Bari]

Huffman Coding — Greedy [Abdul Bari]

Job Sequencing with Deadlines [Farhan]

Huffman Coding [Farhan]

Fractional Knapsack [Farhan]

Dynamic Programming Intro & Knapsack [HFN]

Dynamic Programming — Continued [HFN]

DP — Knapsack & LCS [HFN]

Dynamic Programming — Basics [FHZ]

0/1 Knapsack — Brute Force [FHZ]

0/1 Knapsack — DP Table [FHZ]

Longest Common Subsequence [FHZ]

Dynamic Programming & LCS [MUNR]

LCS — Solved Example [MUNR]

Principle of Optimality — DP Intro [Abdul Bari]

Multistage Graph — DP [Abdul Bari]

Multistage Graph — Program [Abdul Bari]

Matrix Chain Multiplication [Abdul Bari]

Matrix Chain Multiplication — DP Formula [Abdul Bari]

Matrix Chain Multiplication — Program [Abdul Bari]

0/1 Knapsack — Two Methods [Abdul Bari]

0/1 Knapsack — Program [Abdul Bari]

Optimal Binary Search Tree [Abdul Bari]

Optimal BST — Successful & Unsuccessful [Abdul Bari]

Traveling Salesman Problem — DP [Abdul Bari]

Reliability Design — DP [Abdul Bari]

LCS — Recursion and DP [Abdul Bari]

0/1 Knapsack [Farhan]

Longest Common Subsequence [Farhan]

Sum of Subsets — Dynamic Programming [Farhan]

Traveling Salesman Problem — DP [Farhan]

Multistage Graph — Forward Approach [Farhan]

Multistage Graph — Backward Approach [Farhan]

Coin Change — Total Ways [Farhan]

Coin Change — Minimum Coins [Farhan]

Rod Cutting Problem [Farhan]

Backtracking Algorithms [MUNR]

Introduction to Backtracking [Abdul Bari]

N-Queens Problem — Backtracking [Abdul Bari]

Sum of Subsets — Backtracking [Abdul Bari]

Graph Coloring — Backtracking [Abdul Bari]

Hamiltonian Cycle — Backtracking [Abdul Bari]

N-Queens Problem [Farhan]

Sum of Subsets [Farhan]

Hamiltonian Cycle [Farhan]

Graph Coloring Problem [Farhan]

Branch and Bound — Introduction [Abdul Bari]

Job Sequencing — Branch and Bound [Abdul Bari]

0/1 Knapsack — Branch and Bound [Abdul Bari]

Traveling Salesman — Branch and Bound [Abdul Bari]

Traveling Salesman Problem — Branch & Bound [Farhan]

P vs NP [FHZ]

NP-Hard & NP-Complete Problems [Abdul Bari]

NP-Hard Graph Problem — Clique [Abdul Bari]

P, NP, NP-Hard, NP-Complete [Farhan]

KMP String Matching [Abdul Bari]

Rabin-Karp String Matching [Abdul Bari]

AVL Tree — Insertion & Rotations [Abdul Bari]

B Trees & B+ Trees [Abdul Bari]

Hashing Technique — Simplified [Abdul Bari]

Row-Major & Column-Major Mapping [Abdul Bari]