Set, Map, and Priority Queue

Welcome to Week 12! 🎉 This week, we will explore three essential data structures: Set, Map, and Priority Queue. These structures play a crucial role in solving a wide range of computational problems efficiently. Understanding their implementation and use cases will enhance your problem-solving skills. Let’s dive in! 🚀

---

📚 Resources

📝 Topic	Type	🔗 Link
Priority Queue & Set (2024 Session)	🎬 Video	▶ Watch Here
Map (2024 Session)	🎬 Video	▶ Watch Here
Set	🎬 Video	▶ Watch Here
Map	🎬 Video	▶ Watch Here
Compare Functions	🎬 Video	▶ Watch Here
Operator Overloading	🎬 Video	▶ Watch Here [this part until 01:06:30]
Comparators	📖 Article	Read Here
Sets & Maps (Intro)	📖 Article	Read Here
More on Sets, Maps	📖 Article	Read Here
Priority Queues	📖 Article	Read Here

---

🎥 Additional Learning - Prof. Mostafa Saad

📝 Topic	🔗 Link
Heap	▶ Watch Here
Binary Search Tree	▶ Watch Here
Hash Table	▶ 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 - Problem	Watch Solution	Code
B - Problem	Watch Solution	Code
C - Problem	Watch Solution	Code

---

🏆 Weekly Contest

• Contest Link: Access Codeforces Problems
• Problems Overview:

🔍 Problem	🎥 Video Tutorial	🔗 Code Solution
A - Heap Operations	Watch Solution	Code
B - The Mystic Rune Arrangement	Watch Solution	Code
C - The Enchanted Scrolls of Eldoria	Watch Solution	Code
D - The Alchemist’s Gift	Watch Solution	Code
E - The Scribe’s Dilemma	Watch Solution	Code
F - The Enchanted Script of Eldoria	Watch Solution	Code

💬 Community Support

For any questions, join the discussion in our Discord’s #community-chat. We’re here to help you every step of the way!

---