Level 1 Training (2025)

This program builds on your foundation with core algorithms, data structures, and number theory. By the end, you'll be ready to confidently solve Div2 A, B, and C problems.

Go to Session Archive Go to Practice Sheet

Level 1 Program Overview

Our Level 1 training is a comprehensive 9-week program designed to take you from foundational knowledge to intermediate competitive programming skills. Each week focuses on specific topics with hands-on practice, contests, and guidance from our experienced coaching team.

Program Structure:

  • 9 weekly modules covering essential algorithms and data structures
  • Weekly contests to test your understanding and problem-solving skills
  • Resource materials including recordings, notes, and practice problems
  • Coach-led sessions for live instruction and Q&A support

Your Level 1 Coaches:

Meet the dedicated coaches who will guide you through this journey. Click on any coach to learn more about them.

Ahmed Mohamed
Mohamed Khaled
Abdelrhman Mostafa
Mohamed Hani
Abdelrhman Elhabal
Maryam Abdelhady
Menna Fathy
Ready to dive in? Let's explore the weekly breakdown:

Week 1 STL Fundamentals: Linear & Nonlinear Containers 🔥 Current Week

  • STL Containers: vector, pair, queue, deque, stack.
  • Library Sorting & Custom Comparators.
  • STL Containers: map, set, priority_queue, multiset.
  • Sorting with lower/upper bound.
  • 3-hour STL contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 2 Greedy & Constructive Algorithms

  • Introduction to Greedy algorithms and problem-solving techniques.
  • Developing constructive thinking for building solutions.
  • Problems involving permutations and array construction.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 3 Ad-hoc Problems & Prefix Sum Techniques

  • Ad-hoc problem-solving techniques and patterns.
  • 1D & 2D Prefix Sums and Partial Sums.
  • Frequency Arrays and counting techniques.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 4 Advanced Prefix Techniques & Number Theory Basics

  • Prefix/Suffix with min, max, gcd, lcm operations.
  • Prime Numbers, Prime Factorization, and Sieve of Eratosthenes.
  • Basic number theory concepts.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 5 GCD, LCM & Divisibility

  • Euclidean Algorithm for GCD and Extended Euclidean Algorithm.
  • LCM calculations and properties.
  • Divisibility rules and applications.
  • Calculating divisors and their properties.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 6 Bitwise Operations & Bitmasking

  • Bitwise Operators: AND, OR, XOR, NOT, Left/Right Shift.
  • Applications: Parity checks, counting set bits, and manipulating bits.
  • Introduction to Bitmasking for subsets and state representation.
  • Complete Search with Bitmasking.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 7 Modular Arithmetic & Fast Exponentiation

  • Modular arithmetic properties and operations.
  • Fast Exponentiation (Binary Exponentiation) for efficient computation.
  • Modular inverse and applications.
  • Practical problems involving large numbers and modular constraints.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 8 Binary Search & Applications

  • Binary Search algorithm and its variants.
  • Binary Search on the answer technique.
  • Applications in optimization problems.
  • Lower bound and upper bound techniques.
  • 3-hour contest.

Topic Resources:

Title Coach / Instructor Recording / Material

Week 9 Two Pointers & Sliding Window

  • Two Pointers technique for array and string problems.
  • Sliding Window approach for subarray problems.
  • Applications in finding subarrays with specific properties.
  • Optimization techniques for linear time complexity.
  • 3-hour final contest.

Topic Resources:

Title Coach / Instructor Recording / Material