Skip to content

PRO TIP Block youtube.com at the DNS level — Pi-hole, NextDNS or your hosts file — but allow youtube-nocookie.com and i.ytimg.com. These tutorials keep playing; the rabbit hole does not.

Learning without distractions
  1. 1 11:49 1. Introduction to Algorithms Abdul Bari · 7.5M views
  2. 2 1:48 1.1 Priori Analysis and Posteriori Testing Abdul Bari · 1.5M views
  3. 3 5:37 1.2 Characteristics of Algorithm Abdul Bari · 1.4M views
  4. 4 10:37 1.3 How Write and Analyze Algorithm Abdul Bari · 1.6M views
  5. 5 12:22 1.4 Frequency Count Method Abdul Bari · 1.6M views
  6. 6 9:44 1.5.1 Time Complexity #1 Abdul Bari · 3.2M views
  7. 7 14:13 1.5.2 Time Complexity Example #2 Abdul Bari · 1.8M views
  8. 8 21:54 1.5.3 Time Complexity of While and if #3 Abdul Bari · 1.3M views
  9. 9 3:10 1.6 Classes of functions Abdul Bari · 726.2K views
  10. 10 5:11 1.7 Compare Class of Functions Abdul Bari · 645K views
  11. 11 15:46 1.8.1 Asymptotic Notations Big Oh – Omega – Theta #1 Abdul Bari · 2.5M views
  12. 12 10:07 1.8.2 Asymptotic Notations – Big Oh – Omega – Theta #2 Abdul Bari · 1.1M views
  13. 13 11:58 1.9 Properties of Asymptotic Notations Abdul Bari · 822.4K views
  14. 14 9:28 1.10.1 Comparison of Functions #1 Abdul Bari · 672.4K views
  15. 15 10:26 1.10.2 Comparison of Functions #2 Abdul Bari · 470.2K views
  16. 16 18:56 1.11 Best Worst and Average Case Analysis Abdul Bari · 1M views
  17. 17 26:04 1.12 Disjoint Sets Data Structure – Weighted Union and Collapsing Find Abdul Bari · 1.2M views
  18. 18 7:04 2 Divide And Conquer Abdul Bari · 1.4M views
  19. 19 13:43 2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1 Abdul Bari · 2.3M views
  20. 20 16:00 2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2 Abdul Bari · 1.4M views
  21. 21 12:25 2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3 Abdul Bari · 947.7K views
  22. 22 10:42 2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4 Abdul Bari · 909.4K views
  23. 23 8:10 2.2 Masters Theorem Decreasing Function Abdul Bari · 890.1K views
  24. 24 8:41 2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1 Abdul Bari · 704.2K views
  25. 25 7:26 2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2 Abdul Bari · 655K views
  26. 26 11:20 2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3 Abdul Bari · 941.6K views
  27. 27 16:50 2.4.1 Masters Theorem in Algorithms for Dividing Function #1 Abdul Bari · 1.8M views
  28. 28 5:41 2.4.2 Examples for Master Theorem #2 Abdul Bari · 550.9K views
  29. 29 5:37 2.5 Root function (Recurrence Relation) Abdul Bari · 439.7K views
  30. 30 19:36 2.6.1 Binary Search Iterative Method Abdul Bari · 1.1M views
  31. 31 7:11 2.6.2 Binary Search Recursive Method Abdul Bari · 703.5K views
  32. 32 51:08 2.6.3 Heap – Heap Sort – Heapify – Priority Queues Abdul Bari · 2.9M views
  33. 33 20:19 2.7.1 Two Way MergeSort – Iterative method Abdul Bari · 923K views
  34. 34 20:23 2.7.2. Merge Sort Algorithm Abdul Bari · 2.3M views
  35. 35 13:28 2.7.3 MergeSort in-depth Analysis Abdul Bari · 442.7K views
  36. 36 13:43 2.8.1 QuickSort Algorithm Abdul Bari · 4M views
  37. 37 11:37 2.8.2 QuickSort Analysis Abdul Bari · 1.1M views
  38. 38 23:40 2.9 Strassens Matrix Multiplication Abdul Bari · 1.6M views
  39. 39 12:02 3. Greedy Method – Introduction Abdul Bari · 2M views
  40. 40 15:30 3.1 Knapsack Problem – Greedy Method Abdul Bari · 3.1M views
  41. 41 13:29 3.2 Job Sequencing with Deadlines – Greedy Method Abdul Bari · 1.9M views
  42. 42 9:33 3.3 Optimal Merge Pattern – Greedy Method Abdul Bari · 726.7K views
  43. 43 17:33 3.4 Huffman Coding – Greedy Method Abdul Bari · 2.3M views
  44. 44 20:12 3.5 Prims and Kruskals Algorithms – Greedy Method Abdul Bari · 3.8M views
  45. 45 18:35 3.6 Dijkstra Algorithm – Single Source Shortest Path – Greedy Method Abdul Bari · 4.8M views
  46. 46 14:52 4 Principle of Optimality – Dynamic Programming introduction Abdul Bari · 1.6M views
  47. 47 21:07 4.1 MultiStage Graph – Dynamic Programming Abdul Bari · 1.4M views
  48. 48 14:26 4.1.1 MultiStage Graph (Program) – Dynamic Programming Abdul Bari · 432.7K views
  49. 49 14:13 4.2 All Pairs Shortest Path (Floyd-Warshall) – Dynamic Programming Abdul Bari · 3.6M views
  50. 50 23:00 4.3 Matrix Chain Multiplication – Dynamic Programming Abdul Bari · 2.5M views
  51. 51 52:02 [New] Matrix Chain Multiplication using Dynamic Programming Formula Abdul Bari · 1.1M views
  52. 52 18:40 4.3.1 Matrix Chain Multiplication (Program) – Dynamic Programming Abdul Bari · 428.7K views
  53. 53 17:12 4.4 Bellman Ford Algorithm – Single Source Shortest Path – Dynamic Programming Abdul Bari · 2.4M views
  54. 54 28:24 4.5 0/1 Knapsack – Two Methods – Dynamic Programming Abdul Bari · 4.1M views
  55. 55 17:00 4.5.1 0/1 Knapsack Problem (Program) – Dynamic Programming Abdul Bari · 777.8K views
  56. 56 30:19 4.6 Optimal Binary Search Tree (Successful Search Only) – Dynamic Programming Abdul Bari · 1.5M views
  57. 57 57:00 4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability – Dynamic Programming Abdul Bari · 673.7K views
  58. 58 17:18 4.7 [New] Traveling Salesman Problem – Dynamic Programming using Formula Abdul Bari · 702.3K views
  59. 59 26:32 4.8 Reliability Design – Dynamic Programming Abdul Bari · 511.8K views
  60. 60 23:35 4.9 Longest Common Subsequence (LCS) – Recursion and Dynamic Programming Abdul Bari · 1.6M views
  61. 61 18:31 5.1 Graph Traversals – BFS & DFS -Breadth First Search and Depth First Search Abdul Bari · 5M views
  62. 62 8:37 5.2 Articulation Point and Biconnected Components Abdul Bari · 683K views
  63. 63 8:15 6 Introduction to Backtracking – Brute Force Approach Abdul Bari · 1.8M views
  64. 64 13:41 6.1 N Queens Problem using Backtracking Abdul Bari · 2.9M views
  65. 65 12:19 6.2 Sum Of Subsets Problem – Backtracking Abdul Bari · 2M views
  66. 66 15:52 6.3 Graph Coloring Problem – Backtracking Abdul Bari · 1.7M views
  67. 67 18:35 6.4 Hamiltonian Cycle – Backtracking Abdul Bari · 1.4M views
  68. 68 9:40 7 Branch and Bound Introduction Abdul Bari · 1.3M views
  69. 69 10:56 7.1 Job Sequencing with Deadline – Branch and Bound Abdul Bari · 515.1K views
  70. 70 10:48 7.2 0/1 Knapsack using Branch and Bound Abdul Bari · 1.8M views
  71. 71 24:42 7.3 Traveling Salesman Problem – Branch and Bound Abdul Bari · 2.6M views
  72. 72 31:53 8. NP-Hard and NP-Complete Problems Abdul Bari · 2.7M views
  73. 73 17:14 8.1 NP-Hard Graph Problem – Clique Decision Problem Abdul Bari · 867.4K views
  74. 74 18:56 9.1 Knuth-Morris-Pratt KMP String Matching Algorithm Abdul Bari · 2.4M views
  75. 75 23:50 9.2 Rabin-Karp String Matching Algorithm Abdul Bari · 1.2M views
  76. 76 43:08 10.1 AVL Tree – Insertion and Rotations Abdul Bari · 1.7M views
  77. 77 39:41 10.2 B Trees and B+ Trees. How they are useful in Databases Abdul Bari · 1.6M views
  78. 78 22:44 Asymptotic Notations – Simplified Abdul Bari · 134K views
  79. 79 17:04 Hashing Technique – Simplified Abdul Bari · 908.7K views
  80. 80 26:13 Shortest Path Algorithms (Dijkstra and Bellman-Ford) – Simplified Abdul Bari · 275.6K views
  81. 81 19:13 BFS DFS – Simplified Abdul Bari · 239.6K views
  82. 82 9:32 Tower of Hanoi Problem – Made Easy Abdul Bari · 989.7K views
  83. 83 19:16 Row-Major and Column-Major Mapping Abdul Bari · 77.8K views
  84. 84 16:38 Merge Sort Algorithm – Hindi Abdul Bari · 120K views