31:538. NP-Hard and NP-Complete Problems
Abdul Bari2.78M views
NP-hard and NP-complete problems: nondeterministic algorithms, reductions and satisfiability.
267,244 videos · Algorithms, systems, security, machine learning and building software.
31:532.78M views
NP-hard and NP-complete problems: nondeterministic algorithms, reductions and satisfiability.
13:413.01M views
The N-Queens problem solved by backtracking, with the state-space tree drawn out.
18:354.97M views
Dijkstra's single-source shortest-path algorithm, its greedy logic, and its failure with negative edges.
26:041.23M views
Disjoint-set (union-find) with weighted union and path-collapsing find.
20:232.31M views
Merge sort: the algorithm traced step by step, with its analysis.
13:434.05M views
How quicksort partitions around a pivot, traced by hand.
28:244.3M views
The 0/1 knapsack problem solved two ways with dynamic programming: the tabulation and set methods.
43:081.75M views
AVL trees: balance factors and the four rotation cases on insertion.
20:123.91M views
Prim's and Kruskal's algorithms for minimum spanning trees, worked by hand on example graphs.
17:332.39M views
Huffman coding as a greedy algorithm: building the tree and computing code lengths.
16:501.83M views
The master theorem for divide-and-conquer recurrences, with worked examples.
23:002.6M views
Matrix chain multiplication: choosing the optimal parenthesisation with dynamic programming.
18:315.16M views
Breadth-first and depth-first search on graphs, traced by hand.
17:122.44M views
The Bellman–Ford single-source shortest-path algorithm, including negative edges.
39:411.66M views
B-trees and B+ trees: structure, insertion, and why databases use them for indexing.
15:462.57M views
Asymptotic notation: Big-O, Omega and Theta, with examples.
51:083.01M views
Heaps, heapify, heap sort and priority queues, worked through on the whiteboard.
23:351.61M views
Longest common subsequence by recursion and by dynamic programming.
18:562.52M views
The Knuth–Morris–Pratt string-matching algorithm and its prefix (failure) table.
14:133.69M views
The Floyd–Warshall all-pairs shortest-path algorithm via dynamic programming.
29:47A 30-minute video from IIT Roorkee July 2018: “Lecture 3: Free Variable, Scope, and Reduction”.
8:41A 9-minute video from Craig'n'Dave: “22. AQA A Level (7517) SLR4 - 4.2.1 Static and dynamic data structures”.
1:21:31A 82-minute video from UofU Data Science: “Advanced Algorithms - Fall 2017 Lecture 14”.
13:30A 14-minute video from Stanford Algorithms: “ALL-PAIRS SHORTEST PATHS: The Floyd Warshall Algorithm”.
1:26:31Intermediate
A 87-minute video from C. Seshadhri: “CSE201, Lec 4: More on Depth-First Search, Topologically sorting a DAG”.
1:11:19A 71-minute video from Mohammad Hajiaghayi: “Lesson 1: Network Algorithms and Approximations by Mohammad Hajiaghayi: Introduction and Set Cover”.
1:10:23A 70-minute video from Mohammad Hajiaghayi: “Lesson 6: Introduction to Algorithms by Mohammad Hajiaghayi: Smart Algorithm Design Strong Induction”.
25:07A 25-minute video from Anjali Kantharuban: “Discussion 09 Walkthrough • CS 61B Spring 2022”.
1:23:17A 83-minute video from Justin Solomon: “Applied Numerical Algorithms, fall 2023 (lecture 9): QR iteration, SVD”.
12:54A 13-minute video from Stanford Algorithms: “THE KNAPSACK PROBLEM: Example”.
5:45A 6-minute video from Craig'n'Dave: “38. AQA GCSE (8525) SLR7 - 3.1 Algorithm inputs, processes & outputs”.
51:51Intermediate
A 52-minute video from UB CSE 331: “11/03/2017: Analysis of Mergesort”.
8:32A 9-minute video from Craig'n'Dave: “38. AQA A Level (7517) SLR5 - 4.3.3 Reverse Polish notation Part 1”.
1:20:26A 80-minute video from UofU Data Science: “Data Mining (Spring 2023) - Spectral Clustering”.
52:58A 53-minute video from Abrahim Ladha: “CS3510 L10A Chain Matrix Multiplication”.
1:14:37A 75-minute video from Kent Quanrud: “Lazy data structures (Fundamental Algorithms, Spring 2022, Lecture 19)”.