Coursera: Algorithms - Princeton University (Part I + Part II)

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. An introduction to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Specific topics covered include: union-find algorithms; basic iterable data types (stack, queues, and bags); sorting algorithms (quicksort, mergesort, heapsort) and applications; priority queues; binary search trees; red-black trees; hash tables; and symbol-table applications.

Part I covers basic iterable data types, sorting, and searching algorithms.
Part II covers graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.

Content:

Part 1:
01 - Course Introduction.mp4
02 - Union-Find - Dynamic Connectivity.mp4
03 - Union-Find - Quick Find.mp4
04 - Union-Find - Quick Union.mp4
05 - Union-Find - Quick-Union Improvements.mp4
06 - Union-Find - Applications.mp4
07 - Analysis of Algorithms - Introduction.mp4
08 - Analysis of Algorithms - Observations.mp4
09 - Analysis of Algorithms - Mathematical Models.mp4
10 - Analysis of Algorithms - Order-of-Growth Classifications.mp4
11 - Analysis of Algorithms - Theory of Algorithms.mp4
12 - Analysis of Algorithms - Memory.mp4
13 - Bags, Queues, And Stacks - Stacks.mp4
14 - Bags, Queues, And Stacks - Resizing Arrays.mp4
15 - Bags, Queues, And Stacks - Queues.mp4
16 - Bags, Queues, And Stacks - Generics.mp4
17 - Bags, Queues, And Stacks - Iterators.mp4
18 - Bags, Queues, And Stacks - Applications.mp4
19 - Elementary Sorts - Rules of the Game.mp4
20 - Elementary Sorts - Selection Sort.mp4
21 - Elementary Sorts - Insertion Sort.mp4
22 - Elementary Sorts - Shellsort.mp4
23 - Elementary Sorts - Shuffling.mp4
24 - Elementary Sorts - Convex Hull.mp4
25 - Mergesort - Mergesort.mp4
26 - Mergesort - Bottom-up Mergesort.mp4
27 - Mergesort - Sorting Complexity.mp4
28 - Mergesort - Comparators.mp4
29 - Mergesort - Stability.mp4
30 - Quicksort - Quicksort.mp4
31 - Quicksort - Selection.mp4
32 - Quicksort - Duplicate Keys.mp4
33 - Quicksort - System Sorts.mp4
34 - Priority Queues - APIs and Elementary Implementations.mp4
35 - Priority Queues - Binary Heaps.mp4
36 - Priority Queues - Heapsort.mp4
37 - Priority Queues - Event-Driven Simulation.mp4
38 - Symbol Tables - API.mp4
39 - Symbol Tables - Elementary Implementations.mp4
40 - Symbol Tables - Ordered Operations.mp4
41 - Binary Search Trees - BSTs.mp4
42 - Binary Search Trees - Ordered Operations.mp4
43 - Binary Search Trees - Deletion.mp4
44 - Balanced Search Trees - 2-3 Search Trees.mp4
45 - Balanced Search Trees - Red-Black BSTs.mp4
46 - Balanced Search Trees - B-Trees.mp4
47 - Hash Tables - Hash Functions.mp4
48 - Hash Tables - Separate Chaining.mp4
49 - Hash Tables - Linear Probing.mp4
50 - Hash Tables - Context.mp4
51 - Geometric Applications of BSTs - 1d Range Search.mp4
52 - Geometric Applications of BSTs - Line Segment Intersection.mp4
53 - Geometric Applications of BSTs - Kd-Trees.mp4
54 - Geometric Applications of BSTs - Interval Search Trees.mp4
55 - Geometric Applications of BSTs - Rectangle Intersection.mp4
56 - Symbol Table Applications - Sets.mp4
57 - Symbol Table Applications - Dictionary Clients.mp4
58 - Symbol Table Applications - Indexing Clients.mp4
59 - Symbol Table Applications - Sparse Vectors.mp4

Part 2:
01 - Undirected Graphs - Introduction.mp4
02 - Undirected Graphs - Graph API.mp4
03 - Undirected Graphs - Depth-First Search.mp4
04 - Undirected Graphs - Breadth-First Search.mp4
05 - Undirected Graphs - Connected Components.mp4
06 - Undirected Graphs - Challenges.mp4
07 - Directed Graphs - Introduction.mp4
08 - Directed Graphs - Digraph API.mp4
09 - Directed Graphs - Digraph Search.mp4
10 - Directed Graphs - Topological Sort.mp4
11 - Directed Graphs - Strong Components.mp4
12 - Minimum Spanning Trees - Introduction.mp4
13 - Minimum Spanning Trees - Greedy Algorithm.mp4
14 - Minimum Spanning Trees - Edge-Weighted Graph API.mp4
15 - Minimum Spanning Trees - Kruskal's Algorithm.mp4
16 - Minimum Spanning Trees - Prim's Algorithm.mp4
17 - Minimum Spanning Trees - Context.mp4
18 - Shortest Paths - APIs.mp4
19 - Shortest Paths - Shortest Paths Properties.mp4
20 - Shortest Paths - Dijkstra's Algorithm.mp4
21 - Shortest Paths - Edge-Weighted DAGs.mp4
22 - Shortest Paths - Negative Weights.mp4
23 - Maximum Flow - Introduction.mp4
24 - Maximum Flow - Ford-Fulkerson Algorithm.mp4
25 - Maximum Flow - Maxflow-Mincut Theorem.mp4
26 - Maximum Flow - Running Time Analysis.mp4
27 - Maximum Flow - Java Implementation.mp4
28 - Maximum Flow - Applications.mp4
29 - String Sorts - Strings in Java.mp4
30 - String Sorts - Key Indexed Counting.mp4
31 - String Sorts - LSD Radix Sort.mp4
32 - String Sorts - MSD Radix Sort.mp4
33 - String Sorts - 3-Way Radix Quicksort.mp4
34 - String Sorts - Suffix Arrays.mp4
35 - Tries - R-Way Tries.mp4
36 - Tries - Ternary Search Tries.mp4
37 - Tries - Ternary Search Tries - 2.mp4
38 - Tries - Character-Based Operations.mp4
39 - Substring Search - Introduction.mp4
40 - Substring Search - Brute Force.mp4
41 - Substring Search - Knuth-Morris-Pratt.mp4
42 - Substring Search - Boyer-Moore.mp4
43 - Substring Search - Rabin-Karp.mp4
44 - Regular Expressions - Regular Expressions.mp4
45 - Regular Expressions - NFAs.mp4
46 - Regular Expressions - NFA Simulation.mp4
47 - Regular Expressions - NFA Construction.mp4
48 - Regular Expressions - Applications.mp4
49 - Data Compression - Introduction.mp4
50 - Data Compression - Run-Length Coding.mp4
51 - Data Compression - Huffman Compression.mp4
52 - Data Compression - LZW Compression.mp4
53 - Reductions - Introduction.mp4
54 - Reductions - Designing Algorithms.mp4
55 - Reductions - Establishing Lower Bonds.mp4
56 - Reductions - Classifying Problems.mp4
57 - Linear Programming - Brewer's Problem.mp4
58 - Linear Programming - Simplex Algorithm.mp4
59 - Linear Programming - Implementations.mp4
60 - Linear Programming - Reductions.mp4
61 - Intractability - Introduction.mp4
62 - Intractability - Search Problems.mp4
63 - Intractability - P vs. NP.mp4
64 - Intractability - Classifying Problems.mp4
65 - Intractability - NP-Completeness.mp4
66 - Intractability - Coping with Intractability.mp4

also You can watch my other helpful: Coursera-posts
(if old file-links don't show activity, try copy-paste them to the address bar)