diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/100-dijkstras-algorithm.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/100-dijkstras-algorithm.md
index 78aa1f7db..58a222cd2 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/100-dijkstras-algorithm.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/100-dijkstras-algorithm.md
@@ -1,6 +1,8 @@
# Dijkstra's Algorithm
+Dijkstra's algorithm is a greedy algorithm that finds the shortest path between two nodes in a graph. It is a very common algorithm used in computer science and is used in many applications such as GPS navigation, network routing, and finding the shortest path in a maze.
Free Content
+Dijkstra's Algorithm in 3 Minutes
Dijkstra's Algorithm - MIT
Speeding Up Dijkstra's Algorithm - MIT
diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/101-huffman-coding.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/101-huffman-coding.md
index 0974d6cfe..9aba55b6a 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/101-huffman-coding.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/101-huffman-coding.md
@@ -1 +1,8 @@
-# Huffman coding
\ No newline at end of file
+# Huffman Coding
+
+Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the largest code.
+
+Free Content
+Huffman Coding
+Huffman Coding | Greedy Algo-3
+Huffman Coding - Greedy Method
diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/102-kruskas-algorithm.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/102-kruskas-algorithm.md
index 2b291a884..6e67267d4 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/102-kruskas-algorithm.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/102-kruskas-algorithm.md
@@ -1 +1,7 @@
-# Kruskas algorithm
\ No newline at end of file
+# Kruskal's algorithm
+
+Kruskal's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted graph. It is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component).
+
+Free Content
+Kruskal's Algorithm in 2 Minutes
+Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7
diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/103-ford-fulkerson-algorithm.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/103-ford-fulkerson-algorithm.md
index 5015372ec..bf9482c81 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/103-ford-fulkerson-algorithm.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/103-ford-fulkerson-algorithm.md
@@ -1 +1,8 @@
-# Ford fulkerson algorithm
\ No newline at end of file
+# Ford Fulkerson Algorithm
+
+Ford Fulkerson Algorithm is a greedy algorithm that is used to find the maximum flow in a flow network. It is also known as the Edmonds-Karp Algorithm.
+
+Free Content
+Ford-Fulkerson in 5 minutes
+Ford-Fulkerson Algorithm for Maximum Flow Problem
+Ford-Fulkerson Algorithm
diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/104-prims-algorithm.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/104-prims-algorithm.md
index 88e7777b3..2e6f14622 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/104-prims-algorithm.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/104-prims-algorithm.md
@@ -1 +1,8 @@
-# Prims algorithm
\ No newline at end of file
+# Prim's Algorithm
+
+Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. A minimum spanning tree for a weighted undirected graph is also called a minimum weight spanning tree or minimum cost spanning tree.
+
+Free Content
+Graph Algorithms I - Topological Sorting, Prim's Algorithm - Lecture 6
+Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
+Prim's Algorithm
diff --git a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/readme.md b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/readme.md
index 7492b86a9..efd97c45e 100644
--- a/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/readme.md
+++ b/content/roadmaps/103-computer-science/content/104-common-algorithms/104-greedy-algorithms/readme.md
@@ -1 +1,10 @@
-# Greedy algorithms
\ No newline at end of file
+# Greedy Algorithms
+
+Greedy algorithms are a type of algorithm that always makes the choice that seems to be the best at that moment. This means that it makes a locally-optimal choice in the hope that this choice will lead to a globally-optimal solution.
+
+Free Content
+Greedy Algorithms - Geeks for Geeks
+Greedy Algorithms - Programiz
+Greedy Algorithms Tutorial – Solve Coding Challenges
+
+