Week 4 (Greedy)

Greedy Algorithm

Welcome to Week 4! This week, we’ll explore Greedy Algorithms, one of the most intuitive yet tricky paradigms in algorithm design. Greedy algorithms make local optimal choices with the hope of reaching a global optimum. While simple in concept, greedy solutions only work for certain types of problems — learning to identify these is key! We'll study examples involving sorting, interval scheduling, and more. Mastering greedy techniques will greatly enhance your problem-solving toolkit.

---

📚 Resources

📝 Topic	Type	🔗 Link
Greedy Algorithms (Dr. Mostafa Saad Playlist)	🎬 Video	▶ Watch Here
Greedy Algorithms (USACO Guide - Sorting)	📄 Article	Explore Here
Greedy Algorithms (2024 Session)	🎬 Video	▶ Watch Here

---

🎥 Lecture Session

📝 Topic	🔗 Link
🎬 Recording	Watch
📄 Slides	View
🔍 Problems	Coming Soon
💻 Codes and Solutions	Codes

---

📄 Practice Sheet

• Sheet Link: Access Problem Sheet

Problems

🔍 Problem Name	🎥 Video Solution	💻 Code Solution
A -	Watch Solution	Code
B -	Watch Solution	Code
C -	Watch Solution	Code
D -	Watch Solution	Code
E -	Watch Solution	Code

---

🏆 Weekly Contest

• Contest Link: Access Codeforces Problems
• Problems Overview:

🔍 Problem	🎥 Video Tutorial	🔗 Code Solution
A - Contest Problem A	Watch Solution	Code
B - Contest Problem B	Watch Solution	Code
C - Contest Problem C	Watch Solution	Code
D - Contest Problem D	Watch Solution	Code

---

💬 Community Support

Join the discussion and ask your questions in our Discord’s #community-chat. We’re here to help and support your learning journey! 💬

---

✨ Stay sharp — greedy might look easy, but choosing the right strategy is the real challenge! 💡