Competitive Programming Resources

A curated collection of videos and resources to master various topics in competitive programming. The materials cover Dynamic Programming (DP), Number Theory, Segment Trees, and Tries, featuring content by notable creators and educators.

---

Table of Contents

• Dynamic Programming (DP)
• Number Theory
• Segment Tree
• Trie
• DataStructure
• Different Algorithms

---

Dynamic Programming (DP)

• Mahmoud Ayman

  • Video 1
  • Video 2
  • Video 3

• Shayan

  • Dynamic Programming Playlist

---

Number Theory

• Shayan

  • Video 1
  • Video 2
  • Video 3

• Dr. Mostafa Saad (Advanced)

  • Number Theory Playlist

---

Segment Tree

• Mahmoud Ayman

  • Video 1
  • Video 2
  • Video 3
  • Video 4

• Codeforces Course

  • Codeforces Segment Tree Course
    • Go to Segment Tree Part 1 and Part 2 to watch videos and solve problems.

---

Trie

• Mahmoud Ayman
  • Trie Video

---

DS

• Scanline Algorithm -To Study -quesition 1

---

Different Algorithms

• Kadane's Algorithn (Maximum subarray sum) Know it

For more problems on these topics, check out this Codeforces blog post.

Collected by Abdallah Ahmed