diff --git a/Algorithms Specialization/Part 3/README.md b/Algorithms Specialization/Part 3/README.md
index 7b4d68d..f2549b4 100644
--- a/Algorithms Specialization/Part 3/README.md	
+++ b/Algorithms Specialization/Part 3/README.md	
@@ -1 +1,26 @@
-empty
\ No newline at end of file
+# Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
+
+by Stanford University
+
+## About this Course
+
+The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
+
+### Week 1
+
+Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
+
+### Week 2
+
+Kruskal's MST algorithm and applications to clustering; advanced union-find.
+
+### Week 3
+
+Huffman codes; introduction to dynamic programming.
+
+### Week 4
+
+Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
+
+Following the online course:
+<https://www.coursera.org/learn/algorithms-greedy>