Update README.md

Author: JawadSher

25 - Greedy Algorithm Problems/README.md

@@ -119,4 +119,28 @@ Build a binary tree to encode data such that the overall size of the encoded dat
 - Scenarios that allow breaking problems into simpler subproblems.
 - When performance and simplicity are priorities. 
 
-Would you like to see more examples or dive into any specific problem in detail?
+## Repository Content
+<p>
+<img src="https://img.shields.io/badge/problems%20count-00-orange?logo=leetcode" alt="LeetCode">
+<img src="https://img.shields.io/badge/problems%20count-11-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
+<img src="https://img.shields.io/badge/total%20problems%20count-11-blue" alt="Problem Count"> 
+</p>
+
+
+| No  | Problem Name                                                                 | Description                                                                 | LeetCode | GFG  |
+|-----|-------------------------------------------------------------------------------|-----------------------------------------------------------------------------|----------|------|
+| 01  | [N Meetings in One Room](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/01%20-%20N%20Meetings%20in%20One%20Room) | Find the maximum number of meetings that can be conducted in one room.       | Non      | [Link](https://www.geeksforgeeks.org/problems/n-meetings-in-one-room-1587115620/1)  |
+| 02  | [Maximum Meetings in One Room](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/02%20-%20Maximum%20Meetings%20in%20One%20Room) | Maximize the number of meetings in a single room by scheduling them optimally. | Non      | [Link](https://www.geeksforgeeks.org/problems/maximum-meetings-in-one-room/0)  |
+| 03  | [Shop in Candy Store](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/03%20-%20Shop%20in%20Candy%20Store) | Select the most expensive candies from a store, keeping the total cost within a budget. | Non      | [Link](https://www.geeksforgeeks.org/problems/shop-in-candy-store1145/1)  |
+| 04  | [Check if it is possible to survive on Island](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/04%20-%20Check%20if%20it%20is%20possible%20to%20survive%20on%20Island) | Check if it's possible to survive on an island based on available resources. | Non      | [Link](https://www.geeksforgeeks.org/problems/check-if-it-is-possible-to-survive-on-island4922/0)  |
+| 05  | [Reverse Words](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/05%20-%20Reverse%20Words) | Reverse the order of words in a given string.                               | Non      | [Link](https://www.geeksforgeeks.org/problems/reverse-words-in-a-given-string5459/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card)  |
+| 06  | [Chocolate Distribution Problem](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/06%20-%20Chocolate%20Distribution%20Problem) | Distribute chocolates in such a way that the minimum difference between the maximum and minimum chocolates is minimized. | Non      | [Link](https://www.geeksforgeeks.org/problems/chocolate-distribution-problem3825/1)  |
+| 07  | [Minimum Cost of Ropes](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/07%20-%20Minimum%20Cost%20of%20Ropes) | Minimize the cost of connecting ropes of different lengths.                  | Non      | [Link](https://www.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1)  |
+| 08  | [Huffman Encoding](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/08%20-%20Huffman%20Encoding) | Perform data compression using Huffman encoding.                             | Non      | [Link](https://www.geeksforgeeks.org/problems/huffman-encoding3345/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card)  |
+| 09  | [Fractional Knapsack](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/09%20-%20Fractional%20Knapsack) | Solve the knapsack problem by taking fractional items to maximize the total value. | Non      | [Link](https://www.geeksforgeeks.org/problems/fractional-knapsack-1587115620/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card)  |
+| 10  | [Activity Selection](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/10%20-%20Activity%20Selection) | Select the maximum number of activities that can be performed by a single person, given start and finish times. | Non      | [Link](https://www.geeksforgeeks.org/problems/activity-selection-1587115620/1)  |
+| 11  | [Job Sequencing Problem](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/25%20-%20Greedy%20Algorithm%20Problems/11%20-%20Job%20Sequencing%20Problem) | Sequence jobs in a way that maximizes profit, subject to deadlines.           | Non      | [Link](https://www.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1)  |
+
+---
+Happy Coding! 😊
+