Coursera - Dynamic Programming, Greedy Algorithms

Files Included :

01 what-are-divide-and-conquer-algorithms.mp4 (10.6 MB)
MP4
01 max-subarray-problem-using-divide-and-conquer.mp4 (123.31 MB)
MP4
01 karatsubas-multiplication-algorithm.mp4 (173.08 MB)
MP4
01 master-method-revisited.mp4 (41.58 MB)
MP4
01 fft-part-1-introduction-and-complex-numbers.mp4 (67.44 MB)
MP4
03 fft-part-2-definition-and-interpretation-of-discrete-fourier-transforms.mp4 (49.28 MB)
MP4
05 fft-part-3-divide-and-conquer-algorithm-for-fft.mp4 (36.55 MB)
MP4
06 application-1-fast-polynomial-multiplication-using-fft.mp4 (12.61 MB)
MP4
07 application-2-data-analysis-using-fft.mp4 (32.12 MB)
MP4
01 introduction-to-dynamic-programming-rod-cutting-problem.mp4 (157.62 MB)
MP4
01 rod-cutting-problem-memoization.mp4 (127.26 MB)
MP4
01 coin-changing-problem.mp4 (62.61 MB)
MP4
01 knapsack-problem.mp4 (164.34 MB)
MP4
01 when-optimal-substructure-fails.mp4 (53.98 MB)
MP4
01 dynamic-programming-longest-common-subsequence.mp4 (135.97 MB)
MP4
01 introduction-to-greedy-algorithms.mp4 (105.03 MB)
MP4
01 greedy-interval-scheduling.mp4 (122.59 MB)
MP4
01 prefix-codes.mp4 (155.41 MB)
MP4
02 huffman-codes.mp4 (52.94 MB)
MP4
03 huffman-codes-proof-of-optimality.mp4 (87.29 MB)
MP4
01 decision-problems-and-languages.mp4 (54.95 MB)
MP4
01 polynomial-time-problems.mp4 (41.44 MB)
MP4
01 np-definition.mp4 (44.75 MB)
MP4
02 np-completeness-and-reductions.mp4 (60.45 MB)
MP4
01 np-complete-problems-examples.mp4 (35.97 MB)
MP4
01 computation-and-physics.mp4 (39.85 MB)
MP4
02 qubits-and-operations.mp4 (53.01 MB)
MP4
03 bells-inequality.mp4 (32.25 MB)
MP4
04 grovers-search-algorithm.mp4 (61.18 MB)
MP4